Two-way automata simulations and unary languages
Journal of Automata, Languages and Combinatorics
Tight bounds on the simulation of unary probabilistic automata by deterministic automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
The Complexity of Probabilistic versus Deterministic Finite Automata
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Errata to: "finite automata and unary languages"
Theoretical Computer Science
Complementing unary nondeterministic automata
Theoretical Computer Science - Descriptional complexity of formal systems
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Finite automata and their decision problems
IBM Journal of Research and Development
Hi-index | 0.00 |
We investigate and compare the descriptional power of unary probabilistic and nondeterministic automata (pfa's and nfa's, respectively). We show the existence of a family of languages hard for pfa's in the following sense: For any positive integer d, there exists a unary d-cyclic language such that any pfa accepting it requires d states, as the smallest deterministic automaton. On the other hand, we prove that there exist infinitely many languages having pfa's which from one side do not match a known optimal state lower bound and, on the other side, they are smaller than nfa's which, in turn, are smaller than deterministic automata.