Efficient constant speed-up for one dimensional cellular automata calculators

Parallel Computing

Volumn 23, Issue 11, 1997, Pages 1663-1671

  Heen, Olivier ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

Cellular automata; Computational complexity; Machine simulation; Speed up

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

CONSTANT SPEED UP THEOREM; EXPONENTIAL GROWTH; ONE DIMENSIONAL CELLULAR AUTOMATA;

AUTOMATA THEORY;

EID: 0031271454     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(97)00078-1     Document Type: Article

References (8)

1. C. Choffrut, K. Čulik, On real-time cellular automata and treillis automata, Information Processing Letters 17 (1983) 149-153.
2. S.N. Cole, Real-time computation by n-dimensional arrays of finite-state machines, IEEE Transactions on Computers 18 (1969) 388-394.
3. O. Heen, Linear speed-up for cellular automata synchronizers and applications, To appear in: Theoretical Computer Science.
4. O. Heen, Linear speed-up without synchronization, Rapport LITP 57, Institut Biaise Pascal, 1995.
5. O. Heen, Économíe de ressources sur automates cellulaires, Thèse de doctorat, LITP, IBP, Université Paris 7, 1996.
6. O.H. Ibarra, S.M. Kim, S. Moran, Sequential machine characterization of treillis and cellular automata and application, SIAM Journal of Computation 14 (1985) 426-427.
7. J. Mazoyer, N. Reimen, A linear speed-up theorem for cellular automata, Theoretical Computer Science 101 (1992) 59-98.
8. A.R. Smith, Simple computation-universal cellular spaces, Journal of the ACM 18 (3) (1971) 339-353.