On total regulators generated by derivation relations
Theoretical Computer Science
Efficient simplicity testing of automata
Theoretical Computer Science
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Finiteness and Regularity in Semigroups and Formal Languages
Finiteness and Regularity in Semigroups and Formal Languages
The commutation of finite sets: a challenging problem
Theoretical Computer Science
Conway's problem for three-word sets
Theoretical Computer Science
The finite power problem revisited
Information Processing Letters
The power of commuting with finite sets of words
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Well quasi-orders generated by a word-shuffle rewriting
Theoretical Computer Science
Well Quasi-orders in Formal Language Theory
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On language inequalities XK ⊆ LX
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Algebraic characterization of the finite power property
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The power of commuting with finite sets of words
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Rational subsets and submonoids of wreath products
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
By means of constructing suitable well quasi-orders of free monoids we prove that all maximal solutions of certain systems of language inequalities are regular. This way we deal with a wide class of systems of inequalities where all constants are languages recognized by finite simple semigroups. In a similar manner we also demonstrate that the largest solution of the inequality XK ⊆ LX is regular provided the language L is regular.