Literature Cited
V. M. Glushkov, “Automaton theory and formal transformations of microprograms,” Kibernetika, No. 5, 1–10 (1965).
V. M. Glushkov and A. V. Anisimov, “Church-Rosser transducers,” Kibernetika, No. 5, 1–8 (1979).
G. E. Tseitlin, “The problem of identity transformations of structured program schemas with closed logical conditions,” Parts 1–3, Kibernetika, No. 3, 50–57 (1978); No. 4, 10–18 (1978); No. 5, 44–51 (1979).
A. A. Letichevskii, “Speeding up iterations of monotone operators,” Kibernetika, No. 4, 1–7 (1976).
G. E. Tseitlin, “Systems of algorithmic algebras and some schemas in homogeneous structures,” in: Problems of Computer System Theory and Design [in Russian], Novosibirsk (1977), pp. 29–40.
B. K. Rosen, “Tree manipulating systems and Church-Rosser theorems,” JACM,20, No. 1, 160–187 (1973).
Additional information
Translated from Kibernetika, No. 3, pp. 56–60, May–June, 1981.
Rights and permissions
About this article
Cite this article
Yushchenko, Y.A. Algorithmic decidability of the Church-Rosser property in algebras of nondeterminate algorithms with closed logical conditions. Cybern Syst Anal 17, 356–360 (1981). https://doi.org/10.1007/BF01068977
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068977