Literature Cited
V. M. Glushkov, “The theory of automata and questions in the design of digital-machine structures,” Kibernetika, No. 1 (1965).
V. M. Glushkov, “The theory of automata and formal transformations of microprograms,” Kibernetika, No. 5 (1965).
V. M. Glushkov and A. A. Letichevskii, “Theory of algorithms and discrete processors,” in: Advances in Information System Sciences, Vol. 1, New York (1969).
A. P. Ershov, “Theory of program schemata,“ in: IFIP Congress Proceedings (1971).
Theory of Programming, Proceedings of a symposium at Novosibirsk [in Russian] (1972).
A. A. Letichevskii, “Functional equivalence of discrete processors. II,” Kibernetika, No. 2 (1970).
A. A. Letichevskii, “The equivalence of automata with regard to a semigroup,” in: Theoretical Cybernetics, Part 6 [in Russian], Izd. IK AN UkrSSR, Kiev (1970).
V. M. Glushkov and A. A. Letichevskii, “The theory of discrete processors,” in: A Collection of Papers on Algebra, dedicated to the Memory of A. I. Mal'tsev [in Russian], Novosibirsk (1972).
A. A. Letichevskii, “The equivalence and optimization of programs,” in: The Theory of Programming, Symposium Proceedings, Part I [in Russian], Novosibirsk (1972).
D. C. Lucham, D. M. R. Park, and M. S. Patterson, “On formalized computer programs,” J. Computers and Systems Sci.,4, No. 3 (1970).
M. C. Patterson, “Problems of solvability in computational models,” in: The Theory of Programming, Symposium Proceedings, Part I [in Russian], Novosibirsk (1972).
Additional information
Translated from Kibernetika, No. 4, pp. 15–26, July–August, 1973.
Rights and permissions
About this article
Cite this article
Letichevskii, A.A. Practical methods for the recognition of the equivalence of discrete processors and program schemata. Cybern Syst Anal 9, 565–576 (1973). https://doi.org/10.1007/BF01068581
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068581