Recursive definition of global cellular-automata mappings

Publication: Research - peer-reviewJournal article – Annual report year: 1994

View graph of relations

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
Publication date1994
Volume49
Issue2
Pages1699-1711
ISSN1063-651X
DOIs
StatePublished

Bibliographical note

Copyright (1994) by the American Physical Society.

CitationsWeb of Science® Times Cited: 2
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 3766908