Simple language equations

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Science. Official publication website can be found on muni.cz.

Authors	KUNC Michal
Year of publication	2005
Type	Article in Periodical
Magazine / Source	Bulletin of the European Association for Theoretical Computer Science EATCS
MU Faculty or unit	Faculty of Science
Citation
Field	General mathematics
Keywords	Language equation; Regular language; Well quasi-order; Recursively enumerable language; Commutation of languages
Description	We survey results, both positive and negative, on regularity of maximal solutions of systems of implicit language equations and inequalities. These results concern inequalities with constant right-hand sides, one-sided linear inequalities, inequalities with restrictions on constants, and commutation equations and inequalities. In addition, we present some of these results in a generalized form in order to underline common principles.
Related projects:	Mathematical structures of algebra and geometry