Factorizations and universal automaton of omega languages

DOI10.1142/S0129054114400279MaRDI QIDQ5247178zbMATH OpenOpenAlexWikidataFDO

Authors Vincent Carnino, Sylvain Lombardy

Publication date 23 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054114400279

zbMATH Keywords

\(\omega\)-languagesBüchi automatafactorization of languagesformal languagesinfinite wordsregular languagesuniversal automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Factorizations and universal automaton of omega languages
• On the minimization problem for \(\omega \)-automata
• Ultimately periodic words of rational ω-languages
• The universal automaton
• Unambiguous Büchi automata.

Cites work

• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
• Unambiguous Büchi automata.

Cited in

(7)

• Operations on weakly recognizing morphisms
• scientific article; zbMATH DE number 2079047 (Why is no real title available?)
• scientific article; zbMATH DE number 1452991 (Why is no real title available?)
• On the minimization problem for \(\omega \)-automata
• Factorizations and universal automaton of omega languages
• Special factors and the combinatorics of suffix and factor automata
• Ultimately periodic words of rational ω-languages

This page was built for publication: Factorizations and universal automaton of omega languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5247178)