Well-quasi-orders and regular -languages
From MaRDI portal
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 -languages
- Fine hierarchy of regular \(\omega\)-languages
Cites work
Cited in
(14)- Fine hierarchy of regular \(\omega\)-languages
- On the regularity of languages on a binary alphabet generated by copying systems
- Well quasi-orders and regular languages
- On well quasiordering of finite languages
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
- Well quasi ordering finite posets and formal languages
- On classes of regular languages related to monotone WQOs
- Well-Quasi Orders and Hierarchy Theory
- Well Quasi-orders in Formal Language Theory
- Extensions of -regular languages
- Regular tree languages and quasi orders
- Automata, Languages and Programming
- Language inclusion algorithms as complete abstract interpretations
- On regularity of context-free 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)
