Skip to main content
SpringerLink
Log in

The problem of completeness in the structural theory of probabilistic automata

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. A. A. Letichevskii, “Completeness conditions in the class of Moore automata,” in: Theory of Automata, Izd. IK AN USSR, Kiev (1963).

    Google Scholar 

  2. E. W. Carlyle, “Reduced forms for stochastic sequential machines,” Cybernetics Reviews, Vol. 3 [in Russian], Moscow (1966).

  3. N. E. Kobrynskii and V. A. Trakhtenbrot, Introduction to the Theory of Finite Automata [in Russian].

  4. L. D. Makarevich, “On the realizability of probabilistic operators in logical nets,” in: Discrete Analysis, No. 15 [in Russian], Novosibirsk (1969).

  5. L. D. Makarevich, “On attainability in probabilistic automata,” Soobshcheniya AN GSSR,53, No. 2 (1969).

Download references

Authors
  1. L. V. Makarevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 17–20, January–February, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Makarevich, L.V. The problem of completeness in the structural theory of probabilistic automata. Cybern Syst Anal 7, 22–26 (1971). https://doi.org/10.1007/BF01070522

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070522

Keywords

Search

Navigation