This is a preview of subscription content, log in via an institution to check access.
Literature cited
M. O. Rabin, “Probabilistic automata,” Kibernet. Sb.,9, 123–134 (1964).
I. N. Kovalenko, “Remark on the complexity of representing events in probabilistic and deterministic automata,” Kibernetika, No. 2, 35–36 (1965).
R. V. Freivald, “Increase in number of states when finite probabilistic automata are made deterministic,” Avtomat. Vychisl. Tekh., No. 3, 39–42 (1982).
I. A. Pokrovskaya, “Some estimates of the number of states of probabilistic automata representing regular languages,” Probl. Kibernet., No. 36, 181–194 (1979).
V. A. Kuz'min, “Realization of functions of the algebra of logic by means of automata, normal algorithms and Turing machines,” Probl., Kibernet., No. 13, 75–96 (1965).
O. Watanabe, “The time-precision tradeoff problem on on-line probabilistic machines,” Theor. Comp. Sci.,24, 105–117 (1983).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 44, No. 3, pp. 289–297, September, 1988.
In conclusion the author expresses deep gratitude to O. B. Lypanov for his attention to the paper.
Rights and permissions
About this article
Cite this article
Ablaev, F.M. Influence of the degree of isolation of the cutpoint on the number of states of a probabilistic automaton. Mathematical Notes of the Academy of Sciences of the USSR 44, 639–643 (1988). https://doi.org/10.1007/BF01159123
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01159123