Synchronization of Regular Automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Synchronization of Regular Automata

Didier Caucal

Résumé

Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consider the class of languages recognized by automata generated by all its synchronized grammars. The synchronization is an automaton-related notion: all grammars generating the same automaton synchronize the same languages. When the synchronizing automaton is unambiguous, the class of its synchronized languages forms an effective boolean algebra lying between the classes of regular languages and unambiguous context-free languages. We additionally provide sufficient conditions for such classes to be closed under concatenation and its iteration.
Fichier principal
Vignette du fichier
SyncAuto.pdf (325.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

Didier Caucal. Synchronization of Regular Automata. MFCS 2009, Aug 2009, Novy Smokovec, Slovakia. pp.2-23, ⟨10.1007/978-3-642-03816-7_2⟩. ⟨hal-00867577⟩
119 Consultations
101 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More