Formal languages
Introduction to algorithms
On the power of synchronization in parallel computations
Discrete Applied Mathematics - Formal language theory
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Mathematical Theory of L Systems
Mathematical Theory of L Systems
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)
On the synchronized derivation depth of context-free grammars
Theoretical Computer Science
Hi-index | 5.23 |
Depth-synchronization measures the number of parallel derivation steps in a synchronized context-free (SCF) grammar. When not bounded by a constant the depth-synchronization measure of an SCF grammar is at least logarithmic and at most linear with respect to the word length. Languages with linear depth-synchronization measure and languages with a depth-synchronization measure in between logarithmic and linear are proven to exist. This gives rise to a strict infinite hierarchy within the family of SCF (and ET0L) languages.