Varieties of finite monoids and Büchi-McNaughton theorem

DOI10.1016/0304-3975(92)90006-2zbMath0761.68049OpenAlexW2041155655MaRDI QIDQ1193885

Phan Trung Huy, Do Long Van

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90006-2

zbMATH Keywords

varieties of recognizable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Rational \(\omega\)-languages are non-ambiguous
• Codeterministic automata on infinite words
• Aperiodic homomorphisms and the concatenation product of recognizable sets
• Ensembles Reconnaissables de Mots Biinfinis
• Star-free regular sets of ω-sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Varieties of finite monoids and Büchi-McNaughton theorem