Synchronization of Grammars

Abstract. 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.

• Type: Conference
• Year: 2008
• Where: CSR
• Authors: Didier Caucal, Stéphane Hassen
• Keywords: CSR 2008, Deterministic Graph Grammars, Height-deterministic Pushdown Automata, Pushdown Automata, Theoretical Computer Science