Number conserving cellular automata II: Dynamics

Theoretical Computer Science

Volumn 304, Issue 1-3, 2003, Pages 269-290

  Formenti, Enrico ^a   Grange, Aristide ^b  

^a AIX MARSEILLE UNIV   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Cellular automata; Classification; Discrete dynamical systems

Indexed keywords

AUTOMATA THEORY; DYNAMICS;

CELLULAR AUTOMATA;

LARGE SCALE SYSTEMS;

EID: 0038487420     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00134-8     Document Type: Article

References (24)

1. Blanchard F., Tisseur P. Some properties of cellular automata with equicontinuity points. Annales de l'Instute Henri Poincaré 36(5):2000;562-582.
2. N. Boccara, H. Fukś, Number-conserving cellular automaton rules, Fundamenta Informaticae, 2002, to appear.
3. Braga G., Cattaneo G., Flocchini P., Mauri G. Complex chaotic behaviour of a class of subshift cellular automata. Complex Systems. 7:1993;269-296.
4. Braga G., Cattaneo G., Flocchini P., Vogliotti C.Q. Pattern growth in elementary cellular automata. Theoret. Comput. Sci. 145:1995;1-26.
5. m Theoret. Comput. Sci. 2(1-2):1999;147-164.
6. Cattaneo G., Margara L. Generalized sub-shifts in elementary cellular automata. the "strange case" of chaotic rule 180 Theoret. Comput. Sci. 201:1998;171-187.
7. Culik K., Pachl J., Yu S. On the limit sets of cellular automata. SIAM J. Comput. 18:1989;831-842.
8. Culik K., Yu S. Undecidability of cellular automata classification schemes. Complex Systems. 2:1988;177-190.
9. Devaney R.L. Introduction to Chaotic Dynamical Systems. 2nd Edition:1989;Addison-Wesley, Reading, MA.
10. Durand B. Global properties of cellular automata. Goles E., Martinez S. Cellular Automata and Complex Systems. 1998;Kluwer, Dordrecht.
11. Durand B., Formenti E., Róka Z. Number-conserving cellular automata I: decidability. Theoret. Comput. Sci. 299:2003;523-535.
12. Hedlund G.A. Endomorphism and automorphism of the shift dynamical system. Math. System Theory. 3:1969;320-375.
13. Kari J. Reversibility and surjectivity problems of cellular automata. J. Comput. System Sci. 48:1994;149-182.
14. Kari J. Rice's theorem for the limit set of cellular automata. Theoret. Comput. Sci. 127(2):1994;229-254.
15. Knudsen C. Chaos without nonperiodicity. Amer. Math. Monthly. 101:1994;563-565.
16. Kurka P. Languages, equicontinuity and attractors in cellular automata. Ergodic Theory Dyn. Systems. 17:1997;417-433.
17. Lind D., Marcus B. An Introduction to Symbolic Dynamics and Coding. 1995;Cambridge University Press, Cambridge.
18. Mazoyer J., Rapaport I. Inducing and order on cellular automata by a grouping operation. STACS'98. Lectures Notes in Computer Science. Vol. 1373:1998;116-127 Springer Verlag, Berlin.
19. Moore C. Unpredictability and undecidability in dynamical systems. Phys. Rev. Lett. 60(20):1990;2354-2357.
20. Moore E.F. Machine models of self-reproduction. Proc. Symp. Appl. Math. 14:1962;13-33.
21. Myhill J. The converse to Moore's garden-of-eden theorem. Proc. Am. Math. Soc. 14:1963;685-686.
22. Nagel K., Schreckenberg M. A cellular automaton for freeway traffic. J. Phys. I. 2:1992;2221-2229.
23. Schereshevsky M.A. Expansiveness, entropy and polynomial growth for maps acting on subshifts by automorphisms. Indag. Math. NS. 4:1993;203-210.
24. Wolfram S. Theory and Applications of Cellular Automata. 1986;World Scientific, Singapore.