| KUNC, Michal. Largest solutions of left-linear language inequalities. In Automata and Formal Languages: 11th International Conference, AFL 2005, Dobogókő, Hungary, May 17-20. Proceedings. Győr: Institute of Informatics, University of Szeged, 2005, s. 178-186. |
Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{610344,
author = {Kunc, Michal},
address = {Győr},
booktitle = {Automata and Formal Languages: 11th International Conference, AFL 2005, Dobogókő, Hungary, May 17-20. Proceedings},
keywords = {Language inequality; Regular language},
language = {eng},
location = {Győr},
pages = {178-186},
publisher = {Institute of Informatics, University of Szeged},
title = {Largest solutions of left-linear language inequalities},
year = {2005}
}
TY - JOUR
ID - 610344
AU - Kunc, Michal
PY - 2005
TI - Largest solutions of left-linear language inequalities
PB - Institute of Informatics, University of Szeged
CY - Győr
KW - Language inequality
KW - Regular language
N2 - 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.
ER -
KUNC, Michal. Largest solutions of left-linear language inequalities. In \textit{Automata and Formal Languages: 11th International Conference, AFL 2005, Dobogók\H o, Hungary, May 17-20. Proceedings}. Gy\H or: Institute of Informatics, University of Szeged, 2005, s.~178-186.
|
