Abstract:
This paper is a survey of the most important results in the theory of probabilistic automata obtained from the start of the development of the theory through 1974. References are given to the basic papers on the topics discussed.
This publication is cited in the following 11 articles:
Dmitry Aleksandrovich Alfer'ev, Sergey Vladimirovich Dianov, Konstantin Anatol'yevich Gulin, Vyacheslav Konstantinovich Shcherbin, Daniil Sergeyevich Dianov, Lecture Notes in Networks and Systems, 951, Understanding the Digital Transformation of Socio-Economic-Technological Systems, 2024, 123
Paul C. Bell, “Polynomially ambiguous probabilistic automata on restricted languages”, Journal of Computer and System Sciences, 127 (2022), 53
Krishnendu Chatterjee, Raimundo Saona, Bruno Ziliotto, “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives”, Mathematics of OR, 47:1 (2022), 100
S Shalagin, A Nurutdinova, “Stochastic identification of the “Object-attribute” table based on the modified Rabiner's method”, J. Phys.: Conf. Ser., 1925:1 (2021), 012014
A. D. Yashunsky, “Algebras of probability distributions on finite sets”, Proc. Steklov Inst. Math., 301 (2018), 304–318