On conservative and monotone one-dimensional cellular automata and their particle representation

Theoretical Computer Science

Volumn 325, Issue 2 SPEC. ISS., 2004, Pages 285-316

  Moreira, Andrés ^a   Boccara, Nino ^b,c   Goles, Eric ^a  

^a DEPARTAMENTO DE FÍSICA   (Chile)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c SERVICE DE PHYSIQUE DE L ETAT CONDENSÉ   (France)

Author keywords

Cellular automata; Interacting particles; Number conserving systems

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER GRAPHICS; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; NUMBER THEORY; PROBABILITY; SET THEORY;

CELLULAR AUTOMATA (CA); INTERACTING PARTICLE SYSTEMS (IPS); NUMBER CONSERVING SYSTEMS;

AUTOMATA THEORY;

EID: 4444268808     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.06.010     Document Type: Article

References (31)

1. Boccara N., Fukś H. Cellular automaton rules conserving the number of active sites. J. Phys. A: Math. Gen. 31:1998;6007-6018.
2. Boccara N., Fukś H. Number-conserving cellular automaton rules. Fund. Inform. 52:2001;1-13.
3. Boccara N., Nasser J., Roger M. Particle-like structures and their interactions in spatio-temporal patterns generated by one-dimensional deterministic cellular automaton rules. Phys. Rev. A. 44:1991;866-875.
4. Boon J.P. Statistical mechanics and hydrodynamics of lattice gas automata. an overview Physica D. 47:1991;3-8.
5. Braga G., Cattaneo G., Flocchini P., Mauri G. Complex chaotic behaviour of a class of subshift cellular automata. Complex Systems. 7:1993;269-296.
6. Braga G., Cattaneo G., Flocchini P., Vogliotti C.Q. Pattern growth in elementary cellular automata. Theoret. Comput. Sci. 145:1995;1-26.
7. R. Das, M. Mitchell, J.P. Crutchfield, A genetic algorithm discovers particle-based computation in cellular automata, in: Y. Davidor, H.-P. Schwefel, R. Manner (Eds.), Parallel Problem Solving from Nature - PPSN III, Springer, Berlin, 1994, pp. 344-353.
8. Durand B., Formenti E., Róka Z. Number-conserving cellular automata I. decidability Theoret. Comput. Sci. 299:2003;523-535.
9. B. Durand, E. Formenti, Z. Róka, Number-conserving cellular automata: from decidability to dynamics. http://arxiv.org/abs/nlin.CG/0102035, preprint.
10. H. Fukś, A class of cellular automata equivalent to deterministic particle systems, in: S. Feng, A.T. Lawniczak, S.R.S. Varadhan (Eds.), Hydrodynamic Limits and Related Topics, American Mathematical Society, Providence, RI, 2000.
11. H. Fukś, Probabilistic cellular automata with conserved quantities, http://arxiv.org/abs/nlin.CG/0305051, preprint.
12. Hanson J.E., Crutchfield J.P. Computational mechanics of cellular automata. an example Physica D. 103:1997;169-189.
13. Hattori T., Takesue S. Additive conserved quantities in discrete-time lattice dynamical systems. Physica D. 49:1991;295-322.
14. Hocknew R.W., Eastwood J.W. Computer Simulation Using Particles. 1988;Adam Hilger, New York.
15. Hordijk W., Shalizi C., Crutchfield J.P. Upper bound on the products of particle interactions in cellular automata. Physica D. 154:2001;240-258.
16. K. Imai, K. Fujita, C. Iwamoto, K. Morita, Embedding a logically universal model and a self-reproducing model into number-conserving cellular automata, in: C. Calude, M.J. Dinneen, F. Peper (Eds.), UMC, Lecture Notes in Computer Science, Vol. 2509, Springer, Berlin, 2002.
17. Kohyama T. Cellular automata with particle conservation. Progr. Theoret. Phys. 81:1989;47-59.
18. Kohyama T. Cluster growth in particle-conserving cellular automata. J. Statist. Phys. 63:1991;637-651.
19. Kůrka P. Languages, equicontinuity and attractors in cellular automata. Ergodic Theory Dynamical Systems. 17:1997;417-433.
20. Kůrka P. Cellular automata with vanishing particles. Fund. Inform. 58:2003;1-18.
21. Ligget T.M. Interacting Particle Systems. 1985;Springer, Berlin.
22. Margolus N. Physics-like models of computation. Physica D. 10:1984;81-95.
23. Moreira A. Universality and decidability of number-conserving cellular automata. Theoret. Comput. Sci. 292:2003;711-721.
24. K. Morita, K. Imai, Number-conserving reversible cellular automata and their computation-universality, in: Satellite Workshop on Cellular Automata MFCS'98, 1998, pp. 51-68.
25. K. Morita, Y. Tojima, K. Imai, A simple computer embedded in a reversible and number-conserving two-dimensional cellular space, in: Proc. LA Symp. '99, 1999.
26. Nagel K., Schreckenberg M. A cellular automaton model for freeway traffic. J. Phys. I. 2:1992;2221-2229.
27. N. Ollinger, Two-states bilinear intrinsically universal cellular automata, Research Report 2001-11, LIP, École Normale Supérieure de Lyon, 2001.
28. Pivato M. Conservation laws in cellular automata. Nonlinearity. 15:2002;1781-1794.
29. Takai Y., Ecchu K., Takai N. A cellular automaton model of particle motions and its applications. Visual Comput. 11:1995;240-252.
30. Takesue S. Ergodic properties and thermodynamic behavior of elementary reversible cellular automata. I, Basic properties. J. Statist. Phys. 56:1989;371-402.
31. Wolfram S. Theory and Applications of Cellular Automata. 1986;World Scientific, Singapore.