This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, I. V. Vel'bitskii, and A. A. Stognii, “An approach to the design of system software for modern computers,” Kibernetika, No. 3, 25–35 (1972).
V. M. Glushkov and I. V. Vel'bitskii, “A programming technology and problems of its automation,” Ups. Sist. Mash., No. 6, 75–93 (1976).
V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Kibernetika, No. 5, 1–9 (1965).
V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra, Languages, Programming [in Russian], Naukova Dumka, Kiev (1974).
A. P. Ershov, “The state of the art in program schemata theory,” Probl. Kibern., No. 27, 87–110 (1973).
Z. Manna, “The fixpoint theory of programs,” Kibern. Sb., No. 15, 38–100 (1978).
V. Yu. Kayurov, “A nondeterministic version of the R-technology,” in: Programming Technology [in Russian], abstracts of papers at 1st All-Union conf., IK AN UkrSSR, Kiev (1979), pp. 33–35.
Additional information
Translated from Kibernetika, No. 5, pp. 17–21, September–October, 1986.
Rights and permissions
About this article
Cite this article
Kayurov, V.Y. Algebraic interpretation of R-graphs. Cybern Syst Anal 22, 554–559 (1986). https://doi.org/10.1007/BF01068350
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068350