This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, “Abstract automata theory,” Uspekhi Matematicheskikh Nauk, No. 5 (1961).
V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).
A. A. Donis, “The completeness problem in automata theory,” in: Kibernetika (Donetsk Branch), No. 1, Kiev (1970).
A. A. Donis, “Completeness conditions in a class of Moore automata,” in: Issledovaniya po Algebre, No. 2, Saratov State University Press, Saratov (1970).
V. B. Kudryavtsev, “On the power of sets of precomplete sets of functional systems related to automata,” in: Problemy Kibernetiki, No. 13, Nauka, Moscow (1965).
A. A. Letichevskii, “Completeness conditions for finite automata,” Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, No. 4 (1961).
A. A. Letichevskii, “Completeness conditions in a class of Moore automata,” Materials of Seminar on Theoretical and Applied Cybernetics, No. 2, Kiev (1963).
V. N. Red'ko, “On a class of compositions of automata,” in: Teoriya Avtomatov, Naukova Dumka, Kiev (1966).
M. A. Spivak, “The problem of completeness in a class of Moore automata,” Kibernetika, No. 3 (1968).
M. A. Spivak, Introduction to Abstract Automata Theory [in Russian], Saratov State University Press, Saralov (1970).
Additional information
Translated from Kibernetika, No. 3, pp. 36–53, May–June, 1972.
Rights and permissions
About this article
Cite this article
Donis, A.A. Completeness conditions of systems of weakly initial Moore automata. Cybern Syst Anal 8, 387–407 (1972). https://doi.org/10.1007/BF01068993
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068993