Converting Two-Way Nondeterministic Unary Automata into Simpler Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
Journal of Computer and System Sciences
On the descriptional power of heads, counters, and pebbles
Theoretical Computer Science - Descriptional complexity of formal systems
Complementing unary nondeterministic automata
Theoretical Computer Science - Descriptional complexity of formal systems
Magic numbers in the state hierarchy of finite automata
Information and Computation
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
Deterministic Pushdown Automata and Unary Languages
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
A Similarity Measure for Cyclic Unary Regular Languages
Fundamenta Informaticae
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Pairs of complementary unary languages with “balanced” nondeterministic automata
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Magic numbers in the state hierarchy of finite automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Unambiguous finite automata over a unary alphabet
Information and Computation
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An alternating hierarchy for finite automata
Theoretical Computer Science
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Removing nondeterminism in constant height pushdown automata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
We consider the problem of computing the costs---{ in terms of states---of optimal simulations between different kinds of finite automata recognizing unary languages. Our main result is a tight simulation of unary n-state two-way nondeterministic automata by $O({{\rm e}^{\sqrt{{n}\ln{n}}}})$-state one-way deterministic automata. In addition, we show that, given a unary n-state two-way nondeterministic automaton, one can construct an equivalent O(n2)-state two-way nondeterministic automaton performing both input head reversals and nondeterministic choices only at the ends of the input tape. Further results on simulating unary one-way alternating finite automata are also discussed.