Abstract
We show that there exists probabilistic finite automata with an isolated cutpoint and n states such that the smallest equivalent deterministic finite automaton contains \(\Omega \left( {2^{n\tfrac{{\log \log n}}{{\log n}}} } \right)\) states.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Freivalds, On the growth of the number of states in result of determinization of probabilistic finite automata, Avtomatika i Vicislitelnaja Tehnika, 1982, N.3, 39–42 (in Russian)
N. Z. Gabbasov, T. A. Murtazina, Improving the estimate of Rabin's reduction theorem, Algorithms and Automata, Kazan University, 1979, 7–10 (in Russian)
A. Paz, Some aspects of probabilistic automata, Information and Control, 9(1966)
M. O. Rabin, Probabilistic automata, Information and Control, 6(1963), 230–245
B. A. Tracktenbrot, Ya. M. Barzdin', Finite Automata: Behaviour and Synthesis. North-Holland, 1973
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambainis, A. (1996). The complexity of probabilistic versus deterministic finite automata. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009499
Download citation
DOI: https://doi.org/10.1007/BFb0009499
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62048-8
Online ISBN: 978-3-540-49633-5
eBook Packages: Springer Book Archive