This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, “On completeness of systems of operations in electronic computers,” Kibernetika, No. 2 (1968).
Yu. V. Kapitonova, “On the question of bounds on lengths of microprograms in one microprogram algebra”, Kibernetika, No. 1 (1969).
E. N. Vavilov, V. P. Vichev, and L. M. Osinskii, “Estimates of lengths of microprograms for operational automata”, Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6 (1972).
Yu. V. Golunkov, “On complexity of representations of permutations of a symmetric semigroup in terms of elements of a system of generators,” Kibernetika, No. 1 (1971).
Yu. V. Golunkov, “Some remarks on homogeneous tape structures,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6 (1972).
A. G. Kurosh, A Course in Higher Algebra [in Russian], Fizmatgiz, Moscow (1963).
G. Ya. Binder, “Certain complete sets completing symmetric and alternating groups of the n-th degree,” Mat. Zametki,7, No. 2 (1970).
H. Wielandt, Finite Permutation Groups, Academic Press, New York (1964).
Additional information
Translated from Kibernetika, No. 3, pp. 33–39, May–June, 1975.
Rights and permissions
About this article
Cite this article
Golunkov, Y.V. Realization of microprogram bases on shift registers. Cybern Syst Anal 11, 379–385 (1975). https://doi.org/10.1007/BF01069462
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069462