This is a preview of subscription content, log in via an institution to check access.
Literature Cited
G. A. Agasandyan, “Variable-structure automata,” Dokl. Akad. Nauk SSSR,174, 529–530 (1967).
R. G. Bukharaev, “On the representability of events in finite probabilistic automata,” in: Probabilistic Methods in Cybernetics [in Russian], Vol. 5, Kazan' (1967), pp. 7–20.
R. G. Bukharaev, “Theory of probabilistic automata,” Kibernetika, No. 2, 6–23 (1968).
R. G. Bukharaev, “Theory of abstract probabilistic automata,” in: Problems of Cybernetics [in Russian], Vol. 30 (1975), pp. 147–197.
R. Zh. Freizon, “Concerning a certain complexity characteristic of recursive predicates,” in: Transactions of the Mathematics Institute, Academy of Sciences of the USSR [in Russian], Vol. 113 (1969), pp. 79–101.
S. N. Cole, “Real-time computation by n-dimensional iterative array of finite-state machines,” IEEE Trans. Comput.,C-18, 349–365 (1969).
M. Fliess, “Automates stochastiques et séries rationelles non commutatives,” in: Automata, Languages, and Programming, North-Holland, Amsterdam (1973), pp. 397–411.
M. Fliess, “Propriétés booléennes des languages stochastiques,” Math. Syst. Theory,7, 353–359 (1973).
R. Knast, “Representability of nonregular languages by infinite probabilistic automata,” Inf. Control,16, 285–302 (1970).
K. Mahler, “On the Taylor Coefficients of functions,” Proc. Cambridge Philos. Soc.,52, 39–48 (1956).
Z. A. Melzak, “Power series representing certain rational functions,” Canadian J. Math.,12, 20–26, (1960).
M. Nasu and N. Honda, “A context-free language that is not acceptable by a probabilistic automaton,” Inf. Control,18, 233–236 (1971).
R. J. Parikh, “On context-free languages,” J. Assoc. Comput. Mach.,13, 570–581 (1966).
A. Paz, “Some aspects of probabilistic automata,” Inf. Control,9, 26–30 (1966).
A. Paz, Introduction to Probabilistic Automata, Academic Press, New York-London (1971).
Phan Dinh Diêu, “On the languages representable by finite probabilistic automata,” Z. Math. Logik Grundlagen Math.,17, 427–442 (1971).
Phan Dinh Diêu, “On the representability of languages in finite probabilistic automata,” Acta Scientarium Vietnamicarum,7, 44–56 (1971).
Phan Dinh Diêu, “On a necessary condition for stochastic languages,” Elektron. Inform. Kybernetik,8, 447–460 (1972).
Phan Dinh Diêu, “On a complexity characteristic of languages,” Elektron. Inform. Kybernetik,8, 447–460 (1972).
Phan Dinh Diêu and Pham Tra An, “Probabilistic automata with time-variant structure,” Elektron. Inform. Kybernetik,12 (1976).
M. O. Rabin, “Probabilistic automata,” Inf. Control,6, 230–244 (1963).
A. Salomaa, “On madic probabilistic automata,” Inf. Control,10, 215–219 (1967).
A. Salomaa, “On finite automata with a time-variant structure,” Inf. Control,13, 85–98 (1968).
M. P. Schützenberger, “On the definition of a family of automata,” Inf. Control,4, 245–270 (1961).
M. P. Schützenberger, “On a theorem of R. Jungen,” Proc. Amer. Math. Society,13, 885–890 (1962).
P. Turakainen, “On stochastic languages,” Inf. Control,12, 304–313 (1968).
P. Turakainen, “On probabilistic automata and their generalizations,” Ann. Acad. Fennicae, Ser. A l, No. 429 (1968).
P. Turakainen, “Generalized automata and stochastic languages,” Proc. Amer. Math. Society,21, 303–309 (1969).
P. Turakainen, “Some closure properties of the family of stochastic languages,” Inf. Control,18, 253–256 (1971).
Additional information
Translated from Kibernetika, No. 3, pp. 39–50, May–June, 1977.
Rights and permissions
About this article
Cite this article
Phan Dinh Diêu Criteria of representability of languages in probabilistic automata. Cybern Syst Anal 13, 352–364 (1977). https://doi.org/10.1007/BF01069652
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069652