On the power of synchronization in parallel computations
Discrete Applied Mathematics - Formal language theory
Theoretical Computer Science
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
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
On the synchronized derivation depth of context-free grammars
Theoretical Computer Science
Generalized derivations with synchronized context-free grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We consider the descriptional complexity of block-synchronization context-free grammars, BSCF grammars. In particular, we consider the number of necessary situation and begin symbols as complexity measures. For weak and strong derivations, one begin symbol and two situation symbols are sufficient to generate all respective language families. Surprisingly, one situation symbol with equality synchronization is also sufficient to generate all weak derivation BSCF languages. The family of synchronized context-free languages (SCF languages) generated by grammars with one situation symbol using equality synchronization gives a language family properly between that of E0L and ET0L languages. Some normal forms are also presented for all variations. In addition, we show that either prefix or equality synchronization can be used to describe all weak and strong derivation languages.