This is a preview of subscription content, log in via an institution to check access.
Literature Cited
R. W. Ritchie, “Classes of predictably computable functions,” Trans. Am. Math. Soc.,106, 139–173 (1963).
Inoe Katsushi and Nakamura Akira, “Two-dimensional finite automata and unacceptable functions” Int. J. Comput. Math.,7, No. 3, 207–213 (1979).
F. Hennie, Iterative Arrays of Logical Circuits, Wiley, New York (1961).
O. M. Revin, “On interrelationship between unilateral regular and stable systems,” in: All-Union Conference on Topics in Theoretical Cybernetics [in Russian], Inst. Mat. Akad. Nauk SSSR, Novosibirsk (1977), pp. 178–179.
V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).
M. I. Kratko and O. M. Revin, “Turing machines on a plane and stable iterative system,” Kibernetika, No. 5, 146–147 (1977).
M. Blume, “Machine-independent theory of complexity of recursive functions,” in: Topics in Mathematical Logic: Complexity of Algorithms and Classes of Computable Functions [Russian translation], Mir, Moscow (1970), pp. 401–423.
Additional information
Translated from Kibernetika, No. 3, pp. 34–36, 40, May–June, 1985.
Rights and permissions
About this article
Cite this article
Revin, O.M., Tsivlin, Y.V. Functions realizable by one-dimensional iterative systems. Cybern Syst Anal 21, 315–319 (1985). https://doi.org/10.1007/BF01078825
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01078825