Recursive definition of global cellular-automata mappings

Rasmus Feldberg, Carsten Knudsen, Steen Rasmussen

Research output: Contribution to journalJournal articleResearchpeer-review

248 Downloads (Pure)


A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set of fixed points of cellular automata on an infinite lattice.
Original languageEnglish
JournalPhysical Review E. Statistical, Nonlinear, and Soft Matter Physics
Issue number2
Pages (from-to)1699-1711
Publication statusPublished - 1994

Bibliographical note

Copyright (1994) by the American Physical Society.

Fingerprint Dive into the research topics of 'Recursive definition of global cellular-automata mappings'. Together they form a unique fingerprint.

Cite this