Formal languages
Intersection and union of regular languages and state complexity
Information Processing Letters
Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
The state complexities of some basic operations on regular languages
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of formal languages, vol. 1
On equations for union-free regular languages
Information and Computation
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
On the number of distinct languages accepted by finite automata with n states
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the state complexity of reversals of regular languages
Theoretical Computer Science
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Minimal Union-Free Decompositions of Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
Determination of finite automata accepting subregular languages
Theoretical Computer Science
The state complexity of L2 and Lk
Information Processing Letters
Networks of evolutionary processors with subregular filters
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Note on reversal of binary regular languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Basic operations on binary suffix-free languages
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
On external contextual grammars with subregular selection languages
Theoretical Computer Science
Reversal of binary regular languages
Theoretical Computer Science
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
| Hi-index | 0.00 |
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.