Skip to main content
SpringerLink
Log in

Application of growing probabilistic automata for mathematical modeling

  • Published:
Cybernetics Aims and scope

Abstract

We define a growing probabilistic automaton and show how it can be used to predict the behavior of some process from its initial segment.

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

Similar content being viewed by others

Literature Cited

  1. A. A. Dorodnitsyn, “The problem of mathematical modeling in descriptive sciences,” Kibernetika, No. 4, 6–10 (1983).

    Google Scholar 

  2. L. V. Matsevityi, “On some information properties of growing probabilistic automata,” Kibernetika, No. 2, 102–104 (1985).

    Google Scholar 

  3. B. A. Trakhtenbrot and Ya. M. Barzdin', Finite Automata (Behavior and Synthesis) [in Russian], Nauka, Moscow (1970).

    Google Scholar 

Download references

Authors
  1. L. V. Matsevityi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 88–90, January–February, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Matsevityi, L.V. Application of growing probabilistic automata for mathematical modeling. Cybern Syst Anal 25, 111–114 (1989). https://doi.org/10.1007/BF01074892

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation