The intrinsic universality problem of one-dimensional cellular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 632-641

  Ollinger, Nicolas ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR AUTOMATA;

DYNAMICAL PROPERTIES; INTRINSIC UNIVERSALITIES; LONG TIME BEHAVIOR; ONE-TIME; OTHER PROPERTIES; UNDECIDABILITY;

ONE DIMENSIONAL;

EID: 33645616102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_55     Document Type: Article

References (13)

1. J. Albert and K. Čulik II, A simple universal cellular automaton and its one-way and totalistic version, Complex Systems, 1(1987), no. 1, 1-16.
2. S. Amoroso and Y. N. Patt, Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures, J. Comput. System Sci., 6(1972), 448-464.
3. E. R. Banks, Universality in cellular automata, in Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, pages 194-215, IEEE, 1970.
4. K. Čulik II, J. K. Pachl, and S. Yu, On the limit sets of cellular automata, SIAM J. Comput., 18(1989), no. 4, 831-842.
5. J. Kari, The nilpotency problem of one-dimensional cellular automata, SIAM J. Comput., 21(1992), 571-586.
6. J. Kari, Reversibility and surjectivity problems of cellular automata, J. Comput. System Sci., 48(1994), 149-182.
7. J. Kari, Rice's theorem for the limit sets of cellular automata, Theoretical Computer Science, 127(1994), no. 2, 229-254.
8. J. Mazoyer and I. Rapaport, Global fixed point attractors of circular cellular automata and periodic tilings of the plane: undecidability results, Discrete Math., 199(1999), 103-122.
9. J. Mazoyer and I. Rapaport, Inducing an order on cellular automata by a grouping operation, Discrete Appl. Math., 218(1999), 177-196.
10. N. Ollinger, Toward an algorithmic classification of cellular automata dynamics, 2001, LIP RR2001-10, http://www.ens-lyon.fr/LIP.
11. N. Ollinger, The quest for small universal cellular automata, in P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Automata, languages and programming (Málaga, Spain, 2002), volume 2380 of Lecture Notes in Computer Science, pages 318-329, Springer, Berlin, 2002.
12. R. Robinson, Undecidability and nonperiodicity for tilings of the plane, Invent. Math., 12(1971), 177-209.
13. K. Sutner, Classifying circular cellular automata, Physica D, 45(1990), 386-395.