This is a preview of subscription content, log in via an institution to check access.
Literature Cited
J. Von Neumann, A Theory of Self-Reproducing Automata [Russian translation], Mir, Moscow (1971).
E. F. Codd, Cellular Automata, Academic Press New York (1968).
A. R. Smith III, “Cellular automata complexity tradeoffs,” Inf. Control,18, 466–482 (1971).
Yu. N. Kornev, S. V. Piskunov, and S. N. Sergeev, “Generalized substitution algorithms and their interpretation by automaton networks and homogeneous machines,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 6, 131–142 (1971).
Parallel Microprogramming Methods [in Russian], Nauka, Novosibirsk (1981).
P. Rosenstiehl, J. R. Fiksel, and A. Holliger, “Intelligent graphs: networks of finite automata capable of solving graph problems,” in: R. C. Reed (ed.), Graph Theory and Computing, Academic Press, New York (1972), pp. 219–265.
R. J. Lipton, R. E. Miller, and L. Snyder, “Synchronization and computing capability of linear asynchronous structures,” J. Comput. System Sci.,14, 49–72 (1977).
U. Golze, “(A)synchronous (non)deterministic cell spaces simulating each other,” J. Comput. System Sci.,17, No. 2, 176–193 (1978).
T. Toffoli, “Integration of the phase-difference relation in asynchronous sequential networks,” Lect. Notes Computer Sci.,62, 457–463 (1978).
J. Winkowsky, “Game of life as a synchronous process that can be realized asynchronously,” Preprint IPI PAN, No. 286, Warsaw (1977).
S. N. Sergeev, “Recognition of consistent stationary substitution algorithms,” in: Architecture of Computer Systems with Programmable Structure [in Russian], Vychislitel'nye Sistemy, No. 82, 18–25, Nauka, Novosibirsk (1980).
Additional information
Translated from Kibernetika, No. 2, pp. 14–20, 43, March–April, 1984.
Rights and permissions
About this article
Cite this article
Bandman, O.L. Asynchronous interpretation of parallel microprograms. Cybern Syst Anal 20, 184–193 (1984). https://doi.org/10.1007/BF01069173
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069173