Literature Cited
V. P. Kutepov, “Structures of computers and systems,” in: Languages of Parallel Algorithms [in Russian], Izd. MEI, Moscow (1978), pp. 1–90.
B. K. Rosen, “Tree manipulating systems and Church-Rosser therems,” JACM,20, No. 1, 160–181 (1973).
S. Garland and D. Luckham, “Standard schemas, recursive schemas, and formal languages,” Kibern. Sbornik, New Ser., No. 13, 73–119 (1976).
V. P. Kutepov and V. N. Fal'k “Functional systems: theoretical and practical aspects,” Kibernetika, No. 1, 46–58 (1979).
V. P. Kutepov and Yu. P. Korablin, “A flowchart language for parallel algorithms,” Programmirovanie, No. 1, 3–11 (1978).
V. P. Kutepov, “A calculus of functional schemas and parallel algorithms,” Programmirovanie, No. 6, 3–15 (1976).
Yu. P. Korablin, V. P. Kutepov, and V. N. Fal'k, “A calculus of functional schemas,” Tsifrovaya Vychisl. Tekhn. Programm., No. 8, 8–15 (1974).
V. N. Fal'k, Theoretical Models of Programming Languages and Problems of Their Structural Interpretation [in Russian], Abstract of Dissertation, Moscow (1978).
P. S. Dennig, “On the determinacy of schemata,” Report of Project MAC Conf. on Concurrent Systems and Parallel Programming, ACM (1970), pp. 143–147.
Additional information
Translated from Kibernetika, No. 3, pp. 21–27, May–June, 1981.
Rights and permissions
About this article
Cite this article
Kutepov, V.P. Functionality problem in a class of relation schemas. Cybern Syst Anal 17, 319–327 (1981). https://doi.org/10.1007/BF01068971
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068971