Relativised cellular automata and complexity classes
Are linear-time CA (lCA) more powerful than real-time CA (rCA)?
Are nonlinear-time CA more powerful than linear-time CA?
Does one-way communication reduce the power of a CA?
oracles which separate rCA from lCA and lCA from CA,
oracle classes under which the CA classes coincide, and
oracles which leave the CA classes unchanged.
Further, with rCA and lCA at the base, we build a hierarchy of relativised CA complexity classes between rCA and CA, and study the dependencies between the classes in this hierarchy.
KeywordsCellular Automaton Turing Machine Cellular Automaton Transition Rule Input Word
Unable to display preview. Download preview PDF.
- BC.W. Bucher and K. Culik II, On real-time and linear-time cellular automata, RAIRO Inform. Theor. 18(4) (1984) 307–325.Google Scholar
- Dy.C. Dyer, One-way bounded cellular automata, Inform. and Control 44 (1980) 54–69.Google Scholar
- IJ2.O. Ibarra and T. Jiang, On the computing power of one-way cellular arrays, SIAM J. Comput. 16 (1987) 46–55.Google Scholar
- Kos.S. Kosaraju, On some open problems in the theory of cellular automata, IEEE Trans. on Comput. C-23 (1974) 561–565.Google Scholar
- MK1.Meena Mahajan and Kamala Krithivasan, Some results on time-varying and relativised cellular automata, Technical Report Aug 90, Dept. of Computer Science, IIT Madras; submitted for publication.Google Scholar
- MK2.Meena Mahajan and Kamala Krithivasan, Relativised cellular automata and complexity classes, Technical Report Oct 90, Dept. of Computer Science, IIT Madras.Google Scholar
- Sm2.A. Smith III, Real-time language recognition by one-dimensional cellular automata, J. Comput. System. Sci. 6 (1972 233–253.Google Scholar