Regular solutions of language inequalities and well quasi-orders

DOI10.1016/j.tcs.2005.09.018zbMath1081.68047OpenAlexW1979118174MaRDI QIDQ2581271

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

zbMATH Keywords

regular languagewell quasi-orderlanguage equationsyntactic semigroupfinite simple semigroup

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (9)

Weighted Automata on Infinite Words in the Context of Attacker-Defender Games ⋮ Well quasi-orders arising from finite ordered semigroups ⋮ Well quasi-orders generated by a word-shuffle rewriting ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ Well Quasi-orders in Formal Language Theory ⋮ Computing by commuting. ⋮ Weighted automata on infinite words in the context of attacker-defender games ⋮ Language equations ⋮ Rational subsets and submonoids of wreath products.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regularity of context-free languages
• On total regulators generated by derivation relations
• Efficient simplicity testing of automata
• Unrestricted complementation in language equations over a one-letter alphabet
• The commutation of finite sets: A challenging problem
• The finite power problem revisited.
• Conway's problem for three-word sets.
• The theory of well-quasi-ordering: a frequently discovered concept
• Unification in a Description Logic with Transitive Closure of Roles
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• STACS 2005
• Aspects of Molecular Computing

This page was built for publication: Regular solutions of language inequalities and well quasi-orders