Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
Two-way automata simulations and unary languages
Journal of Automata, Languages and Combinatorics
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Optimal Simulations between Unary Automata
SIAM Journal on Computing
Errata to: "finite automata and unary languages"
Theoretical Computer Science
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Complementing two-way finite automata
Information and Computation
Transition complexity of language operations
Theoretical Computer Science
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Converting Self-verifying Automata into Deterministic Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Similarity Measure for Cyclic Unary Regular Languages
Fundamenta Informaticae
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
Note on reversal of binary regular languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Pairs of complementary unary languages with “balanced” nondeterministic automata
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Complementing two-way finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Reversal of binary regular languages
Theoretical Computer Science
On the Size of Unary Probabilistic and Nondeterministic Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 0.00 |
We compare the nondeterministic state complexity of unary regular languages and that of their complements: if a unary language L has a succinct nondeterministic finite automaton, then nondeterminism is useless in order to recognize its complement, namely, the smallest nondeterministic automaton accepting the complement of L has as many states as the minimum deterministic automaton accepting it. The same property does not hold in the case of automata and languages defined over larger alphabets. We also show the existence of infinitely many unary regular languages for which nondeterminism is useless in their recognition and in the recognition of their complements.