S. Willson, \On the ergodic theory of cellular automata." Mathematical Systems Theory 9 (1975) 132-141. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
....sites) the number of allowed con gurations is N(n) 2 4n 4 . A more general statement for periodic sets can be made for a class of CA s that form the 2 d analog of the left (right) permutive CA rules studied in e.g. 22, 30, 34] the ergodic properties of this class of 2 d rules are studied in [59]) Proposition. Consider a 2 d CA with neighborhood B associated with a site (0; 0) Say a site in B is extremal if it cannot be written as a convex combination of other points in B. If the transition function f is an injective function of some extremal site (x; y) when all other inputs are held ....
S. Willson, \On the ergodic theory of cellular automata." Mathematical Systems Theory 9 (1975) 132-141.
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997) (7 citations) (Correct)
....the number of allowed configurations is N(n) 2 4n Gamma4 . A more general statement for periodic sets can be made for a class of CA s that form the 2 d analog of the left (right) permutive CA rules studied in e.g. 19, 25, 29] the ergodic properties of this class of 2 d rules are studied in [54]) Proposition. Consider a 2 d CA with neighborhood B associated with a site (0; 0) Say a site in B is extremal if it cannot be written as a convex combination of other points in B. If the transition function f is an injective function of some extremal site (x; y) when all other inputs are held ....
S. Willson, "On the ergodic theory of cellular automata." Mathematical Systems Theory 9 (1975) 132--141.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC