Complexity in union-free regular languages
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F11%3A00369498" target="_blank" >RIV/67985840:_____/11:00369498 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0129054111008933" target="_blank" >http://dx.doi.org/10.1142/S0129054111008933</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0129054111008933" target="_blank" >10.1142/S0129054111008933</a>
Alternative languages
Result language
angličtina
Original language name
Complexity in union-free regular languages
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Foundations of Computer Science
ISSN
0129-0541
e-ISSN
—
Volume of the periodical
22
Issue of the periodical within the volume
7
Country of publishing house
SG - SINGAPORE
Number of pages
15
Pages from-to
1639-1653
UT code for WoS article
000297580200011
EID of the result in the Scopus database
—