Other formats:
BibTeX
LaTeX
RIS
@article{568469,
author = {Kunc, Michal},
article_number = {February},
keywords = {Language equation; Regular language; Well quasi-order; Recursively enumerable language; Commutation of languages},
language = {eng},
issn = {0252-9742},
journal = {Bulletin of the European Association for Theoretical Computer Science EATCS},
title = {Simple language equations},
volume = {85},
year = {2005}
}
TY - JOUR
ID - 568469
AU - Kunc, Michal
PY - 2005
TI - Simple language equations
JF - Bulletin of the European Association for Theoretical Computer Science EATCS
VL - 85
IS - February
SP - 81
EP - 81
SN - 02529742
KW - Language equation
KW - Regular language
KW - Well quasi-order
KW - Recursively enumerable language
KW - Commutation of languages
N2 - 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.
ER -
KUNC, Michal. Simple language equations. \textit{Bulletin of the European Association for Theoretical Computer Science EATCS}. 2005, vol.~85, February, p.~81-102. ISSN~0252-9742.
|
