Skip to main content
Log in

A method of probabilistic analysis of finite automata

  • Brief Communications
  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. M. K. Chirkov and A. M. Shauman, Principles of the Functional Structure of Computers [in Russian], LGU (1974).

  2. V. I. Levin, Statistical Reliability Synthesis of Automata [in Russian], Zinatne, Riga (1974).

    Google Scholar 

  3. A. M. Bogomolov, A. S. Barashko, and I. S. Grunskii, Experiments with Automata [in Russian], Naukova Dumka, Kiev (1973).

    Google Scholar 

  4. M. S. Bershtein and A. M. Romankevich, “Statistical checking of multicycle schemes,” Avtomat. Vychisl. Tekh., No. 2 (1975).

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

    Google Scholar 

  6. A. A. Borovkov, Course in Probability Theory [in Russian], Nauka, Moscow (1972).

    Google Scholar 

  7. V. P. Kutepov and E. E. Pertsov, “Estimate of the probability and average time for a set of probabilistic graph paths by means of regular expressions,” in: Digital Computing Technique and Programming [in Russian], No. 8, Sovetskoe Radio, Moscow (1974).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 6, pp. 139–140, November–December, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bershtein, M.S. A method of probabilistic analysis of finite automata. Cybern Syst Anal 14, 959–961 (1978). https://doi.org/10.1007/BF01070300

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation