Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Decomposition of probabilistic automata

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    N. E. Kobrinskii and B. A. Trakhtenbrot, Introduction to the Theory of Finite Automata [in Russian], Fizmatgiz, Moscow (1962).

  2. 2.

    V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

  3. 3.

    J. R. Jump, “A note on iterative decomposition of finite automata,” Inf. Control, No. 15 (1969).

  4. 4.

    J. Hartmanis and R. E. Stearns, The Algebraic Structure Theory of Sequential Machines, Prentice-Hall, New York (1966).

  5. 5.

    G. C. Bacon, “The decomposition of stochastic automata,” Inf. Control, No. 7 (1964).

  6. 6.

    J. G. Kemeny and J. L. Snell, Finite Markov Chains, Van Nostrand Reinhold, Princeton, New Jersey (1960).

Download references

Additional information

Translated from Kibernetika, No. 2, pp. 6–11, March–April, 1975.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Giorgadze, A.K., Safiulina, A.G. Decomposition of probabilistic automata. Cybern Syst Anal 11, 183–188 (1975).

Download citation


  • Operating System
  • Artificial Intelligence
  • System Theory
  • Probabilistic Automaton