## Abstract

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 language | English |
---|---|

Journal | Physical Review E. Statistical, Nonlinear, and Soft Matter Physics |

Volume | 49 |

Issue number | 2 |

Pages (from-to) | 1699-1711 |

ISSN | 1063-651X |

DOIs | |

Publication status | Published - 1994 |