Global properties of cellular automata

Journal Article · Mon Mar 31 23:00:00 EST 1986 · J. Stat. Phys.; (United States)

DOI:https://doi.org/10.1007/BF01010579· OSTI ID:5674011

Jen, E

Cellular automata are discrete mathematical systems that generate diverse, often complicated, behavior using simple deterministic rules. Analysis of the local structure of these rules makes possible a description of the global properties of the associated automata. A class of cellular automata that generate infinitely many aperoidic temporal sequences is defined,a s is the set of rules for which inverses exist. Necessary and sufficient conditions are derived characterizing the classes of ''nearest-neighbor'' rules for which arbitrary finite initial conditions (i) evolve to a homogeneous state; (ii) generate at least one constant temporal sequence.

• Research Organization: Institut fuer Physikalische Chemie, Freie Universitaet Berlin, Takustrasse 3, D-1000 Berlin 33 (Dahlem), West Germany
• OSTI ID: 5674011
• Journal Information: J. Stat. Phys.; (United States), Journal Name: J. Stat. Phys.; (United States) Vol. 43:1; ISSN JSTPB
• Country of Publication: United States
• Language: English

Related Subjects

658000* -- Mathematical Physics-- (-1987)
71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
DYNAMICS
GLOBAL ANALYSIS
MATHEMATICAL MODELS
MATHEMATICS
MECHANICS
TIME DEPENDENCE