You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Attractors in Restricted Cellular Automata
Proceedings of the American Mathematical Society
Vol. 115, No. 2 (Jun., 1992), pp. 563-571
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2159280
Page Count: 9
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
The goal of this note is to extend previous results about the dynamics of cellular automata to "restricted cellular automata." Roughly speaking, a cellular automaton is a rule that updates a configuration of "states" that are arranged along the integer lattice in R. In applications one often thinks of one of these states as "blank" or "quiescent," while the other "active" states evolve against a quiescent background. Often the physically relevant configurations are those with only a finite number of active states. If X0 is the set of all such states, and if a cellular automaton maps X0 to X0, then its restriction to X0 is a restricted cellular automaton. The main results show that there are rather strong constraints on the collection of attractors for any restricted cellular automaton. These constraints parallel those described in [H1] for the unrestricted case.
Proceedings of the American Mathematical Society © 1992 American Mathematical Society