This is a preview of subscription content, log in via an institution to check access.
Literature Cited
I. Kohavi and Z. Kohavi, “Variable-length distinguishing sequences and their application to the design of fault-detection experiments,” IEEE Trans. on Computers,EC 17, No. 8 (1968).
A. Gill, Introduction to the Theory of Finite State Machines, McGraw-Hill, New York (1962).
M. N. Sokolovskii, “Diagnostic experiments with automata,” Kibernetika, No. 6 (1971).
V. M. Glushkov, “Abstract theory of automata,” Usp. Matem. Nauk,16, No. 5 (101) (1961).
M. A. Spivak, “Generalized diagnosis and setting problems for finite automata,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3 (1969).
M. A. Spivak, “New solution of the generalized diagnosis and setting problem,” Kibernetika, No. 2 (1969).
M. A. Spivak, “On the formalization of the concept of an experiment with an automaton,” Kibernetika, No. 4 (1970).
V. G. Vizing, “Formalization of some concepts connected with experimentation,” Kibernetika, No. 6 (1971).
M. A. Spivak, Introduction to Abstract Theory of Automata [in Russian], Izd. SGU, Saratov (1970).
Additional information
Translated from Kibernetika, No. 1, pp. 46–49, January–February, 1974.
Rights and permissions
About this article
Cite this article
Gobershtein, S.M. Check words for the states of a finite automaton. Cybern Syst Anal 10, 54–58 (1974). https://doi.org/10.1007/BF01069018
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069018