A class of cellular automata equivalent to deterministic particle systems

Details A class of cellular automata equivalent to deterministic particle systems A class of cellular automata equivalent to deterministic particle systems

2002-07-25

arxiv.org/abs/nlin/0207047v1

in "Hydrodynamic Limits and Related Topics", S. Feng, A. T. Lawniczak and S. R. S. Varadhan (Eds.), AMS, Providence, RI (2000)

Nonlinear Sciences

Cellular Automata and Lattice Gases

14 pages

Scientific paper

We demonstrate that a local mapping f in a space of bisequences over {0,1} which conserves the number of nonzero sites can be viewed as a deterministic particle system evolving according to a local mapping in a space of increasing bisequences over Z. We present an algorithm for determination of the local mapping in the space of particle coordinates corresponding to the local mapping f.

Affiliated with

Also associated with

No associations

Rating

A class of cellular automata equivalent to deterministic particle systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A class of cellular automata equivalent to deterministic particle systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A class of cellular automata equivalent to deterministic particle systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226938