Well-quasi-orders and regular -languages

DOI10.1016/J.TCS.2004.03.052zbMATH Open1105.68065OpenAlexW2110251524MaRDI QIDQ1882913FDOQ1882913

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A syntactic congruence for rational \(\omega\)-languages
• Title not available (Why is that?)
• On regularity of context-free languages

Cited In (13)

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