Abstract
We analyze the effect of the degree of isolation ε of a cut point on the number of states P(U, ε) of a probabilistic automaton representing the language U. We give an example of a language Un consisting of words of length n such that there exist numbers ε′<ε for which P(Un, ε′)/P(Un, ε)→0 as n→∞.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
M. Rabin, “Probabilistic automata,” Inform. Control,6, 230–245 (1963).
N. Z. Gabbasov and T. A. Murtazina, “Improved bounds in Rabin's reduction theorem,” in: Algorithms and Automata [in Russian], Kazan State Univ. (1978), pp. 7–10.
I. A. Pokrovskaya, “Some bounds of the number of states of probabilistic automata representing regular languages,” Probl. Kibern., No. 36, 181–194 (1979).
R. V. Freivald, “Determinization of finite probabilistic automata increases the number of states,” Avtomat. Vychisl. Tekh., No. 3, 39–42 (1982).
V. I. Paul', “A 2.5n lower bound for the combinational complexity of Boolean functions,” Kibern. Sb., No. 16, 23–44 (1979).
V. N. Agofonov, Complexity of Algorithms and Computations [in Russian], Novosibirsk State Univ. (1975).
O. Watanabe, “The time-precision tradeoff problem on on-line probabilistic Turing machines,”, Theor. Comput. Sci.,24, 105–117 (1983).
Additional information
Translated from Kibernetika, No. 3, pp. 21–25, May–June, 1989.
Rights and permissions
About this article
Cite this article
Ablaev, F.M. Comparative complexity of the representation of languages by probabilistic automata. Cybern Syst Anal 25, 311–316 (1989). https://doi.org/10.1007/BF01069985
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01069985