Synchronization of grammars - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Synchronization of grammars


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.
Fichier principal
Vignette du fichier
synchro.pdf (172.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00620185 , version 1 (30-09-2013)



Didier Caucal, Stéphane Hassen. Synchronization of grammars. Third International Computer Science Symposium in Russia (CSR'08), Jun 2008, Moscou, Russia. pp.110-121, ⟨10.1007/978-3-540-79709-8_14⟩. ⟨hal-00620185⟩
149 View
131 Download



Gmail Facebook X LinkedIn More