Synchronization of grammars - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Synchronization of grammars

Résumé

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
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
150 Consultations
139 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More