This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, “The theory of automata and problems in the design of the structures of computers,” Kibernetika, No. 1 (1965).
V. M. Glushkov, “The theory of automata and formal transformations of microprograms,” Kibernetika, No. 5 (1965).
V. M. Glushkov, “Problems in the minimization of programs and algorithmic schemes,” Kibernetika, No. 5 (1966).
V. M. Glushkov and A. A. Letichevskii, “The theory of automata and programming,” First All-Union Programming Conference [in Russian], Kiev (1968).
A. I. Mal'tsev, “Iterative algebras and Post varieties,” Algebra i Logika, 5, No. 2 (1966).
V. N. Red'ko, “Some problems in the theory of languages,” Kibernetika, No. 4 (1965).
V. N. Red'ko and E. L. Yushchenko, “Algorithmic languages and translating systems,” Kibernetika, No 5 (1967).
E. Post, Two-Valued Iterative Systems (1941).
S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, Functions of the Algebra of Logic and Post Classes [in Russian], Izd. Nauka, Moscow (1966).
S. V. Yablonskii, “Functional constructions in k-valued logic,” Trudy Matem. In-ta im. V. A. Steklova,51 (1958).
G. E. Tseitlin, “The problem of functional completeness in a modified Post algebra,” Third Republican Scientific Conference of Young Research Students in Cybernetics [in Russian], Kiev (1968).
V. G. Bodnarchuk and G. E. Tseitlin, “Algebras of periodically defined transformations of an infinite register,” Kibernetika, No. 1 (1969).
E. L. Yushchenko, Address Programming [in Russian], Ukrtekhizdat (1963).
Additional information
Translated from Kibernetika, No. 2, pp. 66–70, March–April, 1971.
Rights and permissions
About this article
Cite this article
Yushchenko, E.L., Tseitlin, G.E. The algebra of multiregister operators. Cybern Syst Anal 7, 280–284 (1971). https://doi.org/10.1007/BF01071799
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071799