Computer simulation using particles
Computer simulation using particles
Statistical mechanics and hydrodynamics of lattice gas automata: an overview
Proceedings of the NATO advanced research workshop on Lattice gas methods for PDE's : theory, applications and hardware: theory, applications and hardware
Pattern growth in elementary cellular automata
Theoretical Computer Science
Computational mechanics of cellular automata: an example
Proceedings of the workshop on Lattice dynamics
Number-conserving cellular automaton rules
Fundamenta Informaticae - Special issue on cellular automata
A Genetic Algorithm Discovers Particle-Based Computation in Cellular Automata
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Universality and decidability of number-conserving cellular automata
Theoretical Computer Science - Algorithms,automata, complexity and games
Number-conserving cellular automata I: decidability
Theoretical Computer Science
Cellular automata with vanishing particles
Fundamenta Informaticae - Special issue on cellular automata
A new dimension sensitive property for cellular automata
Theoretical Computer Science - Mathematical foundations of computer science 2004
On universality of radius 1/2 number-conserving cellular automata
UC'10 Proceedings of the 9th international conference on Unconventional computation
On the relationship between fuzzy and Boolean cellular automata
Theoretical Computer Science
Communication complexity in number-conserving and monotone cellular automata
Theoretical Computer Science
Fluctuation-driven computing on number-conserving cellular automata
Information Sciences: an International Journal
Hi-index | 0.00 |
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. Compliments at http://www.dim.uchile.cl/~anmoreir/ncca