Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657691 | Theoretical Computer Science | 2005 | 17 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Michal Kunc,