On the Limit Sets of Cellular Automata
- 1 August 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (4) , 831-842
- https://doi.org/10.1137/0218057
Abstract
The limit sets of cellular automata, defined by Wolfram, play an important role in applications of cellular automata to complex systems. A number of results on limit sets are proved, considering both finite and infinite configurations of cellular automata. The main concern of this paper is with testing membership and (essential) emptiness of limit sets for linear and two-dimensional cellular automata.Keywords
This publication has 5 references indexed in Scilit:
- Twenty Problems in the Theory of Cellular AutomataPhysica Scripta, 1985
- Computation theory of cellular automataCommunications in Mathematical Physics, 1984
- Universality and complexity in cellular automataPhysica D: Nonlinear Phenomena, 1984
- Undecidability and nonperiodicity for tilings of the planeInventiones Mathematicae, 1971
- Proving Theorems by Pattern Recognition - IIBell System Technical Journal, 1961