This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5 (1965).
V. M. Glushkov, “Completeness of a system of operators in electronic computers,” Kibernetika, No. 2 (1968).
A. A. Letichevskii, “Functional equivalence of discrete transducers, Part I,” Kibernetika, No. 2 (1969).
Yu. V. Golunkov, “Complexity of the implementation of substitutions of a symmetric semigroup in terms of elements of systems of generators,” Kibernetika, No. 1 (1971).
A. N. Radchenko, Code Rings and Their Application in Contactless Encoders [in Russian], Candidate's Dissertation (1958).
S. W. Golomb, L. R. Welch, and R. M. Goldstein, Cycles from Nonlinear Shift Registers, Jet Propulsion Lab., Calif. Inst. Technol., Prog. Rep. No. 20-389, Pasadena, Calif. (August, 1959).
R. P. Bryant, F. G. Heath, and R. D. Killick, “Counting with feedback shift registers by means of a jump technique,” IRE Trans. Electronic Computers, EC-11 (1962).
M. Yoeli, “Binary ring sequences,” Amer. Math. Monthly,69 (1962).
V. M. Glushkov, “The use of abstract automata theory for the minimization of microprograms,” Izv. Akad. Nauk SSSR, Tekhnicheskaya Kibernetika, No. 1 (1964).
Additional information
Kazan. Translated from Kibernetika, No. 5, pp. 6–12, September–October, 1971.
Rights and permissions
About this article
Cite this article
Golunkov, Y.V. Automaton-program implementation of a symmetric semigroup. Part I. Cybern Syst Anal 7, 759–766 (1971). https://doi.org/10.1007/BF01641491
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01641491