Well-quasi-orders and regular \(\omega\)-languages

DOI10.1016/j.tcs.2004.03.052zbMath1105.68065OpenAlexW2110251524MaRDI QIDQ1882913

Mizuhito Ogawa

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.052

zbMATH Keywords

Regularity\(\omega\)-languageWell-quasi-order

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Well-Quasi Orders and Hierarchy Theory

Cites Work

• Unnamed Item
• On regularity of context-free languages
• A syntactic congruence for rational \(\omega\)-languages

This page was built for publication: Well-quasi-orders and regular \(\omega\)-languages