Skip to main content
SpringerLink
Log in

Estimation of the length of the shortest diagnostic word for 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 (1962).

  2. M. N. Sokolovskii, “On the length of diagnostic words for finite automata,” Abstracts of Reports of the Third All-Union Conference on Theoretical Cybernetics [in Russian], Novosibirsk (1974).

  3. I. K. Rystsov, “Diagnosable automata,” Kibernetika, No. 1 (1975).

Download references

Authors
  1. I. K. Rystsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 40–45, November–December, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rystsov, I.K. Estimation of the length of the shortest diagnostic word for a finite automaton. Cybern Syst Anal 14, 845–851 (1978). https://doi.org/10.1007/BF01070277

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation