This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Some Open Problems in the Theory of Cellular Automata
June 1974 (vol. 23 no. 6)
pp. 561-565
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.
Index Terms:
Cellular automata, complexity tradeoffs, interconnection complexity, machine complexity, neighborhood reduction, packing, parallel processing, pattern recognition, pattern transformation.
Citation:
S.R. Kosaraju, "On Some Open Problems in the Theory of Cellular Automata," IEEE Transactions on Computers, vol. 23, no. 6, pp. 561-565, June 1974, doi:10.1109/T-C.1974.223995
Usage of this product signifies your acceptance of the Terms of Use.