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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Kunc, M. (2004). Regular solutions of language inequalities and well quasi-orders. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3142, 870–881. https://doi.org/10.1007/978-3-540-27836-8_73
Mendeley helps you to discover research relevant for your work.