Regular solutions of language inequalities and well quasi-orders
From MaRDI portal
Publication:2581271
DOI10.1016/J.TCS.2005.09.018zbMATH Open1081.68047OpenAlexW1979118174MaRDI QIDQ2581271FDOQ2581271
Authors: Michal Kunc 
Publication date: 9 January 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.018
Recommendations
Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unrestricted complementation in language equations over a one-letter alphabet
- The theory of well-quasi-ordering: a frequently discovered concept
- Title not available (Why is that?)
- Unification in a description logic with transitive closure of roles
- On total regulators generated by derivation relations
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- On regularity of context-free languages
- The commutation of finite sets: A challenging problem
- Conway's problem for three-word sets.
- Aspects of Molecular Computing
- Title not available (Why is that?)
- STACS 2005
- Efficient simplicity testing of automata
- The finite power problem revisited.
- Title not available (Why is that?)
Cited In (16)
- Title not available (Why is that?)
- Automata, Languages and Programming
- Characterization of ordered semigroups generating well quasi-orders of words
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
- On well quasiordering of finite languages
- Well Quasi-orders in Formal Language Theory
- Weighted automata on infinite words in the context of attacker-defender games
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- Well quasi-orders generated by a word-shuffle rewriting
- Well-quasi-orders and regular \(\omega\)-languages
- Computing by commuting.
- Well quasi-orders arising from finite ordered semigroups
- Well quasi ordering finite posets and formal languages
- Weighted automata on infinite words in the context of attacker-defender games
- Language equations
- Developments in Language Theory
This page was built for publication: Regular solutions of language inequalities and well quasi-orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581271)
