Number of the records: 1
Complexity in union-free regular languages
- 1.
SYSNO ASEP 0369498 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Complexity in union-free regular languages Author(s) Jirásková, G. (SK)
Masopust, Tomáš (MU-W) RID, ORCID, SAISource Title International Journal of Foundations of Computer Science - ISSN 0129-0541
Roč. 22, č. 7 (2011), s. 1639-1653Number of pages 15 s. Language eng - English Country SG - Singapore Keywords Union-free regular language ; one-cycle-free-path automaton ; descriptional complexity Subject RIV BA - General Mathematics CEZ AV0Z10190503 - MU-W (2005-2011) UT WOS 000297580200011 EID SCOPUS 82955228052 DOI 10.1142/S0129054111008933 Annotation 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. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2012
Number of the records: 1