Regular solutions of language inequalities and well quasi-orders

DOI10.1016/J.TCS.2005.09.018MaRDI QIDQ2581271zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

regular languagewell quasi-orderlanguage equationsyntactic semigroupfinite simple semigroup

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• Developments in Language Theory
• On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
• Mathematical Foundations of Computer Science 2005
• Well quasi-orders and regular languages

Cites work

• scientific article; zbMATH DE number 1259068 (Why is no real title available?)
• scientific article; zbMATH DE number 2038714 (Why is no real title available?)
• scientific article; zbMATH DE number 2155196 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 789816 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Aspects of Molecular Computing
• Conway's problem for three-word sets.
• Efficient simplicity testing of automata
• On regularity of context-free languages
• On total regulators generated by derivation relations
• STACS 2005
• The commutation of finite sets: A challenging problem
• The finite power problem revisited.
• The theory of well-quasi-ordering: a frequently discovered concept
• Unification in a description logic with transitive closure of roles
• Unrestricted complementation in language equations over a one-letter alphabet
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

Cited in

(16)

• scientific article; zbMATH DE number 3874640 (Why is no real title available?)
• 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)