Další formáty:
BibTeX
LaTeX
RIS
@article{610324, author = {Kunc, Michal}, article_location = {Amsterdam}, article_number = {2-3}, keywords = {Language equation; Regular language; Well quasi-order; Syntactic semigroup; Finite simple semigroup}, language = {eng}, issn = {0304-3975}, journal = {Theoretical Computer Science}, title = {Regular solutions of language inequalities and well quasi-orders}, url = {http://dx.doi.org/10.1016/j.tcs.2005.09.018}, volume = {348}, year = {2005} }
TY - JOUR ID - 610324 AU - Kunc, Michal PY - 2005 TI - Regular solutions of language inequalities and well quasi-orders JF - Theoretical Computer Science VL - 348 IS - 2-3 SP - 277 EP - 277 PB - Elsevier SN - 03043975 KW - Language equation KW - Regular language KW - Well quasi-order KW - Syntactic semigroup KW - Finite simple semigroup UR - http://dx.doi.org/10.1016/j.tcs.2005.09.018 N2 - 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 subset LX is regular provided the language L is regular. ER -
KUNC, Michal. Regular solutions of language inequalities and well quasi-orders. \textit{Theoretical Computer Science}. Amsterdam: Elsevier, 2005, roč.~348, 2-3, s.~277-293. ISSN~0304-3975.
|