Literature Cited
V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).
J. Hartmanis and R. E. Stearns, Algebraic Structure Theory of Sequential Machines, Prentice-Hall, New York, (1966).
G. Birkhoff, Theory of Structures [Russian translation], IL, Moscow (1952).
P. Cohn, Universal Algebra, Harper and Row, New York (1968).
Yu. G. Karpov and M. G. Karpovskii, “Optimal code-redundancy methods for error correction in finite automata,” Kibernetika, No. 1 (1971).
V. A. Kozmidiadi and V. S. Chernyavskii, “On the ordering of a set of automata,” in: Problems in the Theory of Mathematical Machines [in Russian], No. 2, Moscow (1962).
A. T. Pu, “Generalized decomposition of incomplete finite automata,” Inf. Control,13, No. 1 (1968).
C. L. Liu, “Lattice functions, pair algebras, and finite-state machines,” J. ACM,16, No. 3 (1969).
E. G. Wagner, “On connecting modules together uniformly to form a modular computer,” IEEE Trans. on Electronic ComputersEC 15, No. 6 (1966).
R. Jump, “A note on the iterative decomposition of finite automata,” Inf. Control,15, No. 1 (1969).
Additional information
Translated from Kibernetika, No. 3, pp. 21–26, May–June, 1974.
Rights and permissions
About this article
Cite this article
Karpov, Y.G. Method of increasing the reliability of discrete devices that are implemented using microelectronic circuitry. Cybern Syst Anal 10, 398–404 (1974). https://doi.org/10.1007/BF01068705
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068705