Skip to main content
SpringerLink
Log in

Bounds on the length of the diagnostic word 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. A. Gill, Introduction to the Theory of Finite-State Machines, McGraw-Hill, New York (1962).

    Google Scholar 

  2. P. H. Starke, “Über Experimente an Automaten,” Z. Logik Grundlagen Math.,13, No. 1 (1967).

  3. M. N. Sokolovskii, “On diagnostic experiments with automata,” Kibernetika, No. 6 (1971).

  4. K. Prachar, The Distribution of Prime Numbers [Russian translation], Mir, Moscow (1967).

    Google Scholar 

Download references

Authors
  1. M. N. Sokolovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 16–21, March–April, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sokolovskii, M.N. Bounds on the length of the diagnostic word of a finite automaton. Cybern Syst Anal 12, 188–195 (1976). https://doi.org/10.1007/BF01069885

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation