Mathematics – Dynamical Systems
Scientific paper
2001-11-02
Mathematics
Dynamical Systems
19 pages, LaTeX 2E with one (1) Encapsulated PostScript figure. To appear in Nonlinearity. (v2) minor changes/corrections; new
Scientific paper
10.1088/0951-7715/15/6/305
If X is a discrete abelian group and B a finite set, then a cellular automaton (CA) is a continuous map F:B^X-->B^X that commutes with all X-shifts. If g is a real-valued function on B, then, for any b in B^X, we define G(b) to be the sum over all x in X of g(b_x) (if finite). We say g is `conserved' by F if G is constant under the action of F. We characterize such `conservation laws' in several ways, deriving both theoretical consequences and practical tests, and provide a method for constructing all one-dimensional CA exhibiting a given conservation law.
Pivato Marcus
No associations
LandOfFree
Conservation Laws in Cellular Automata 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 Conservation Laws in Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conservation Laws in Cellular Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-481513