Largest solutions of left-linear language inequalities

Warning

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

Authors	KUNC Michal
Year of publication	2005
Type	Article in Proceedings
Conference	Automata and Formal Languages: 11th International Conference, AFL 2005, Dobogókő, Hungary, May 17-20. Proceedings
MU Faculty or unit	Faculty of Science
Citation
Field	General mathematics
Keywords	Language inequality; Regular language
Description	We prove that largest solutions of systems of implicit one-sided linear language inequalities are regular provided all constants occurring on their right-hand sides are regular languages.
Related projects:	Mathematical structures and their physical applications