Issue No. 06 - June (1974 vol. 23)
S.R. Kosaraju , Department of Electrical Engineering, The Johns Hopkins University
Some open problems in the theory of cellular automata are considered: the tradeoff between machine complexity and interconnection complexity, linear time pattern recognition and transformation problems, and the noncomputability of the constant of linearity of linear time problems.
Cellular automata, complexity tradeoffs, interconnection complexity, machine complexity, neighborhood reduction, packing, parallel processing, pattern recognition, pattern transformation.
S. Kosaraju, "On Some Open Problems in the Theory of Cellular Automata," in IEEE Transactions on Computers, vol. 23, no. , pp. 561-565, 1974.