Conclusions
-
1.
The method proposed in this paper for the construction of an automaton with a quasi-finite memory and being equivalent to a given automaton, is fairly simple, does not require a preliminary analysis of the transition function, and can be easily formalized.
-
2.
The results obtained can be extended for the synthesis of schemes of multi-input automata. The number of input signals determines the number of input shift registers. At the same time in the scheme of the automaton only a single binary shift register of feedback is used. The evaluation of register lengths presented in the paper remains unaltered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
I. V. Prangishvili, N. A. Abramova, E. V. Babicheva, and V. V. Ignatushchenko, Microelectronics and Homogeneous Structures for the Construction of Logic and Computing Devices. [in Russian], Nauka, Moscow (1967).
A. D. Friedman, “Feedback in synchronous sequential switching circuits,” IEEE Trans. on El. Comp., EC 15, No. 3 (1966).
A. Hill, An Introduction to the Theory of Finite Automata [Russian translation], Nauka, Moscow (1966).
Additional information
Translated from Kibernetika, No. 2, pp. 35–42, March–April, 1971.
Rights and permissions
About this article
Cite this article
Kostov, K.L., Osinskii, L.M. Synthesis of schemes of finite automata with the use of a single shift register of feedback. Cybern Syst Anal 7, 243–250 (1971). https://doi.org/10.1007/BF01071793
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071793