Recognition of formal languages in one-dimensional iterative automata

F. C. Hennie, Iterative Arrays of Logical Circuits, Wiley, New York-London (1961). E. F. Moore, Sequential Machines (selected papers), Addison-Wesley (1964). A. R. Smith, “Real-time recognition by one-dimensional cellular automata,” J. Comput. Syst. Sci., No. 6, 233–253 (1972). P. Fisher, “Generation of primes in a one-dimensional iterative network in real time,” Cybernetic Collection, New Series [Russian translation], No. 5, Mir, Moscow (1968). T. Kasami, “On the time of machine recognition of languages generated by linear grammars,” in: Problems of Mathematical Logic [Russian translation], Mir, Moscow (1970). S. Cole, “Deterministic automata with stack memory and real-time calculations,” in: Complexity of Algorithms and Calculations [Russian translation], Mir, Moscow (1974). J. W. Thatcher and G. B. Wright, “Generalized theory of finite automata and its application to problems of resolution in second order logic,” Cybernetic Collection, New Series [Russian translation], No. 6, Mir, Moscow (1969). G. S. Plesnevich, “Comparison of two concepts of calculation using one-dimensional iterative automata,” Abstracts of Papers of the International Conference on the Theory of Automata and Artificial Intelligence (Tashkent, 1968) [in Russian], Vychisl. Tsentr Akad. Nauk SSSR, Moscow (1968).