On the synchronized derivation depth of context-free grammars

Authors:
Franziska Biegler;Kai Salomaa
Affiliations:
Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada;School of Computing, Queens University, Kingston, ON K7L 3N6, Canada
Venue:
Theoretical Computer Science
Year:
2009

Citing 14
Cited 0

Formal languages

Formal languages
Introduction to algorithms

Introduction to algorithms
On the power of synchronization in parallel computations

Discrete Applied Mathematics - Formal language theory
Regular languages

Handbook of formal languages, vol. 1
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Mathematical Theory of L Systems

Mathematical Theory of L Systems
On the Height of Syntactical Graphs

Proceedings of the 5th GI-Conference on Theoretical Computer Science
The generative capacity of block-synchronized context-free grammars

Theoretical Computer Science
Descriptional complexity of block-synchronization context-free grammars

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Length synchronization context-free grammars

Journal of Automata, Languages and Combinatorics
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
An infinite hierarchy induced by depth synchronization

Theoretical Computer Science
Synchronization functions of synchronized context-free grammars and languages

Journal of Automata, Languages and Combinatorics
Time-bounded grammars and their languages

Journal of Computer and System Sciences

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider depth of derivations as a complexity measure for synchronized and ordinary context-free grammars. This measure differs from the earlier considered synchronization depth in that it counts the depth of the entire derivation tree. We consider (non-)existence of trade-offs when using synchronized grammars as opposed to non-synchronized grammars and establish lower bounds for certain classes of linear context-free languages.