Well-quasi-orders and regular -languages

DOI10.1016/J.TCS.2004.03.052MaRDI QIDQ1882913zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Well quasi-orders and regular languages
• scientific article; zbMATH DE number 2040909
• Well Quasi-orders in Formal Language Theory
• On well quasiordering of finite languages
• Regular solutions of language inequalities and well quasi-orders
• Automata, Languages and Programming
• Well quasi ordering finite posets and formal languages
• Well quasi-orders and context-free grammars
• Fine hierarchy of regular \(\omega\)-languages
• Fine hierarchy of regular \(\omega\)-languages

Cites work

• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• A syntactic congruence for rational \(\omega\)-languages
• On regularity of context-free languages

Cited in

(13)

• On regularity of context-free languages
• Well quasi-orders and regular languages
• Fine hierarchy of regular \(\omega\)-languages
• Automata, Languages and Programming
• On the regularity of languages on a binary alphabet generated by copying systems
• On well quasiordering of finite languages
• Well quasi ordering finite posets and formal languages
• Language inclusion algorithms as complete abstract interpretations
• Well-Quasi Orders and Hierarchy Theory
• Regular tree languages and quasi orders
• On classes of regular languages related to monotone WQOs
• Well Quasi-orders in Formal Language Theory
• Extensions of \(\omega \)-regular languages

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

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