Factorizations and universal automaton of omega languages - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2014

Factorizations and universal automaton of omega languages

Résumé

We extend the concept of factorization on finite words to omega-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 omega-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.

Dates et versions

hal-01120568 , version 1 (26-02-2015)

Identifiants

Citer

Vincent Carnino, Sylvain Lombardy. Factorizations and universal automaton of omega languages. International Journal of Foundations of Computer Science, 2014, Special Issue – Developments in Language Theory (DLT 2013), 25 (8), pp.1111-1125. ⟨10.1142/S0129054114400279⟩. ⟨hal-01120568⟩
154 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More