Další formáty:
BibTeX
LaTeX
RIS
@article{960266, author = {Jirásková, Galina and Masopust, Tomáš}, article_number = {7}, doi = {http://dx.doi.org/10.1142/S0129054111008933}, keywords = {Union-free regular language; finite automaton; one-cycle-free-path automaton; descriptional complexity; closure properties}, language = {eng}, issn = {0129-0541}, journal = {International Journal of Foundations of Computer Science}, title = {Complexity in Union-Free Regular Languages}, url = {http://dx.doi.org/10.1142/S0129054111008933}, volume = {22}, year = {2011} }
TY - JOUR ID - 960266 AU - Jirásková, Galina - Masopust, Tomáš PY - 2011 TI - Complexity in Union-Free Regular Languages JF - International Journal of Foundations of Computer Science VL - 22 IS - 7 SP - 1639-1653 EP - 1639-1653 PB - World Scientific SN - 01290541 KW - Union-free regular language KW - finite automaton KW - one-cycle-free-path automaton KW - descriptional complexity KW - closure properties UR - http://dx.doi.org/10.1142/S0129054111008933 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 accepted 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. \textit{International Journal of Foundations of Computer Science}. World Scientific, 2011, roč.~22, č.~7, s.~1639-1653. ISSN~0129-0541. Dostupné z: https://dx.doi.org/10.1142/S0129054111008933.
|