Factorizations and Universal Automaton of Omega Languages - Algorithmics Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Factorizations and Universal Automaton of Omega Languages

Résumé

In this paper, we extend the concept of factorization on finite words to ω-rational languages and show how to compute them. We define a normal form for Büchi automata and introduce a universal automaton for Büchi automata in normal form. We prove that, for every ω-rational language, this Büchi automaton, based on factorization, is canonical and that it is the smallest automaton that contains the morphic image of every equivalent Büchi automaton in normal form.
Fichier principal
Vignette du fichier
Factorizations_and_Universal_Automaton_of_omega_Languages.pdf (169.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00841873 , version 1 (09-07-2013)

Identifiants

Citer

Vincent Carnino, Sylvain Lombardy. Factorizations and Universal Automaton of Omega Languages. Developments in Language Theory - 17th International Conference (DLT'13), 2013, Marne-la-Vallée, France. pp.338-349, ⟨10.1007/978-3-642-38771-5_30⟩. ⟨hal-00841873⟩
196 Consultations
453 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More