Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Proof of an achievable bound on the length of a conditional diagnostic experiment for a finite automaton

  • 19 Accesses

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

Literature Cited

  1. 1.

    A. Gill, Introduction to the Theory of Finite-State Machines, McGraw-Hill, New York (1962).

  2. 2.

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

  3. 3.

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

  4. 4.

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

Download references

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

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Finite Automaton
  • Diagnostic Experiment