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)
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
The generative capacity of block-synchronized context-free grammars
Theoretical Computer Science
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
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
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 | 0.00 |
Synchronization functions are introduced to measure the amount of communication necessary to generate synchronized context-free (SCF) languages. The family of SCF languages with a bounded synchronization function equals the family of context-free languages and for non-context-free SCF languages, the synchronization function is proven to be at least linear and at most quadratic. Examples of SCF grammars with synchronization fuctions that are linear, quadratic and strictly between linear and quadratic are provided.