This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
A. Gill, Introduction to the Theory of Finite-State Machines, McGraw-Hill, New York (1962).
M. N. Sokolovskii, “On diagnostic experiments with automata,” Kibernetika, No. 6 (1971).
I. V. Kogan, “A bound on the length of minimal simple conditional diagnostic experiment,” Avtomat. Telemekh., No. 2 (1973).
T. N. Hibbard, “Least upper bounds on minimal terminal state experiments for two classes of sequential machines,” J. ACM, 8 (1961).
Translated from Kibernetika, No. 3, pp. 20–22, May–June, 1976.
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
- Operating System
- Artificial Intelligence
- System Theory
- Finite Automaton
- Diagnostic Experiment