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

Moreira, A.; Boccara, N; Goles, E.

Abstract

Number-conserving (or conservative) cellular automata (CA) have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several issues concerning one-dimensional cellular automata which are conservative, monotone (specially "non-increasing"), or that allow a weaker kind of conservative dynamics. We introduce a formalism of "particle automata", and discuss several properties that they may exhibit, some of which, like anticipation and momentum preservation, happen to be intrinsic to the conservative CA they represent. For monotone CA we give a characterization, and then show that they too are equivalent to the corresponding class of particle automata. Finally, we show how to determine, for a given CA and a given integer b, whether its states admit a b-neighborhood-dependent relabeling whose sum is conserved by the CA iteration; this can be used to uncover conservative principles and particle-like behavior underlying the dynamics of some CA. Complements at http://www.dim.uchile.cl/~anmoreir/ncca © 2004 Elsevier B.V. All rights reserved.

Más información

Título según WOS: On conservative and monotone one-dimensional cellular automata and their particle representation
Título según SCOPUS: On conservative and monotone one-dimensional cellular automata and their particle representation
Título de la Revista: THEORETICAL COMPUTER SCIENCE
Volumen: 325
Número: 2
Editorial: ELSEVIER SCIENCE BV
Fecha de publicación: 2004
Página de inicio: 285
Página final: 316
Idioma: English
URL: http://linkinghub.elsevier.com/retrieve/pii/S0304397504003950
DOI:

10.1016/j.tcs.2004.06.010

Notas: ISI, SCOPUS