Skip to main content
SpringerLink
Log in

Evaluating the complexity of a finite automaton

  • 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. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, Automation of Computer Design [in Russian], Naukova Dumka, Kiev (1975).

    Google Scholar 

  2. F. E. Temnikov, V. A. Afonin, and V. I. Dmitriev, Theoretical Basis of Information Technology [in Russian], Energiya, Moscow (1971).

    Google Scholar 

  3. A. V. Palagin, “Computer program codes using information characteristics,” Upr. Sist. Mashing, No. 2, 50–52 (1972).

    Google Scholar 

  4. B. N. Malinovskii (ed.), Handbook of Computer Technology (Processors and Memories) [in Russian], Tekhnika, Kiev (1979).

    Google Scholar 

Download references

Authors
  1. A. V. Palagin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 42–44, July–August, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Palagin, A.V. Evaluating the complexity of a finite automaton. Cybern Syst Anal 20, 515–519 (1984). https://doi.org/10.1007/BF01068925

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation