FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES

DOI10.1142/S0129054114400279zbMath1317.68090OpenAlexW2275537861WikidataQ114073267 ScholiaQ114073267MaRDI QIDQ5247178

Sylvain Lombardy, Vincent Carnino

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

formal languagesregular languagesBüchi automatainfinite words\(\omega\)-languagesuniversal automatafactorization of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

This page was built for publication: FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES