This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. P. Ershov, “Current state of the theory of program schemes,” Probl. Kibern., No. 27, 87–110 (1973).
A. A. Letichevskii, “Functional equivalence of discrete converters. Part 2,” Kibernetika, No. 2, 14–28 (1970).
D. Lackham, D. M. Park, and M. S. Paterson, “Formalized machine programs,” Kibern. Sb., No. 12, 78–114 (1975).
V. M. Glushkov and A. A. Letichevskii, “Theory of discrete converters,” in: Selected Topics in algebra and Logic [in Russian], Nauka, Novosibirsk (1973), pp. 5–39.
A. A. Letichevskii, “Equivalence of automata with respect to semigroups,” Teor. Avtom., No. 6, 71.
A. B. Godlevskii, “A soluble case of a special problem in the functional equivalence of discrete converters,” in: Design of Computers and Other Digital Devices [in Russian], Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1974), pp. 16–41.
S. Garland and D. Lackham, “Standard schemes, recursive schemes, and formal languages,” Kibern., Sb., No. 13, 73–119 (1976).
S. K. Shukuryan, “A result on the functional equivalence of program schemes with nondegenerate statements,” Programmirovanie, No. 2, 41–49 (1979).
Additional information
Translated from Kibernetika, No. 6, pp. 1–7, November–December, 1980.
Rights and permissions
About this article
Cite this article
Godlevskii, A.B., Letichevskii, A.A. & Shukuryan, S.K. Reducibility of program-scheme functional equivalence on a nondegenerate basis of rank unity to the equivalence of automata with multidimensional tapes. Cybern Syst Anal 16, 793–799 (1980). https://doi.org/10.1007/BF01069053
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069053