Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{891312,
author = {Jirásková, Galina and Masopust, Tomáš},
address = {London, ON, Canada},
booktitle = {DLT 2010, LNCS 6224},
keywords = {Descriptional complexity, union-free regular language, one-cycle-free-path finite automaton.},
language = {eng},
location = {London, ON, Canada},
isbn = {978-3-642-14454-7},
pages = {255-266},
publisher = {Springer-Verlag Berlin Heidelberg},
title = {Complexity in Union-Free Regular Languages},
url = {http://dx.doi.org/10.1007/978-3-642-14455-4_24},
year = {2010}
}
TY - JOUR
ID - 891312
AU - Jirásková, Galina - Masopust, Tomáš
PY - 2010
TI - Complexity in Union-Free Regular Languages
PB - Springer-Verlag Berlin Heidelberg
CY - London, ON, Canada
SN - 9783642144547
KW - Descriptional complexity, union-free regular language, one-cycle-free-path finite automaton.
UR - http://dx.doi.org/10.1007/978-3-642-14455-4_24
N2 - We continue the investigation of union-free regular languages that are described by regular expressions without the union operation. We also define deterministic union-free languages as languages recognized by one-cycle-free-path deterministic finite automata, and show that they are properly included in the class of union-free languages. We prove that (deterministic) union-freeness of languages does not accelerate regular operations, except for the reversal in the nondeterministic case.
ER -
JIRÁSKOVÁ, Galina a Tomáš MASOPUST. Complexity in Union-Free Regular Languages. In \textit{DLT 2010, LNCS 6224}. London, ON, Canada: Springer-Verlag Berlin Heidelberg, 2010, s.~255-266. ISBN~978-3-642-14454-7.
|
