论文信息 - Translating partitioned cellular automata into classical type cellular automata

Translating partitioned cellular automata into classical type cellular automata

Partitioned cellular automata are a variant of cellular automata that was defined in order to make it very simple to create complex automata having strong properties such as number conservation and reversibility (which are often difficult to obtain on cellular automata). In this article we show how a partitioned cellular automaton can be translated into a regular cellular automaton in such a way that these properties are conserved.

Victor Poupet

[1] Katsunobu Imai,et al. Number-Conserving Reversible Cellular Automata and Their Computation-Universality , 2001, RAIRO Theor. Informatics Appl..

[2] Katsunobu Imai,et al. A Simple Computer Embedded in a Reversible and Number-Conserving Two-Dimensional Cellular Space , 1999 .

[3] Michael Schreckenberg,et al. A cellular automaton model for freeway traffic , 1992 .

[4] Y. Pomeau,et al. Lattice-gas automata for the Navier-Stokes equation. , 1986, Physical review letters.

[5] Katsunobu Imai,et al. Universal Computing in Reversible and Number-Conserving Two-Dimensional Cellular Spaces , 2002, Collision-Based Computing.

[6] N. Margolus. Physics-like models of computation☆ , 1984 .

[7] Frisch,et al. Lattice gas automata for the Navier-Stokes equations. a new approach to hydrodynamics and turbulence , 1989 .