Balanced grammars and their languages
Formal and natural computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Synchronization of pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
Test generation from recursive tiles systems
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizing previous sub-classes such as visibly and height-deterministic pushdown automata. The languages recognized by grammars synchronized by a given grammar form an effective boolean algebra lying between regular languages and deterministic context-free languages. We also provide a sufficient condition to obtain the closure under concatenation and its iteration.