Skip to main content
SpringerLink
Log in

Proof of an achievable bound on the length of a conditional diagnostic experiment 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, New York (1962).

    Google Scholar 

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

  3. I. V. Kogan, “A bound on the length of minimal simple conditional diagnostic experiment,” Avtomat. Telemekh., No. 2 (1973).

  4. T. N. Hibbard, “Least upper bounds on minimal terminal state experiments for two classes of sequential machines,” J. ACM, 8 (1961).

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. 3, pp. 20–22, May–June, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rystsov, I.K. Proof of an achievable bound on the length of a conditional diagnostic experiment for a finite automaton. Cybern Syst Anal 12, 354–356 (1976). https://doi.org/10.1007/BF01070013

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation