L. P. Hurd. Recursive cellular automata invariant sets. Complex Systems, 4:119-- 129, 1990. 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)
....This rule reaches a xed point after one time step, so 1 = 1 = 1 and are all described by the LLL where no adjacent pairs of 1 s are allowed. In general, if the limit set of a CA is described by an LLL, then it is reached at nite time. This was stated in [60] and shown for the 1 d case in [25]. The proof for arbitrary dimensions is essentially identical to that in one dimension, even though this case might seem more subtle because of the distinction between the de ning LLL and the set of nite blocks that actually appear in in nite con gurations. 28 Proposition. If the limit set 1 ....
L.P. Hurd, \Recursive cellular automata invariant sets." Complex Systems 4 (1990) 119-129.
On Two-Sided Infinite Fixed Points of Morphisms - Jeffrey Shallit, Ming-wei Wang (1999) (Correct)
....the two sided infinite fixed points of h. Related work was done by Lando [14] Two sided infinite words (sometimes called bi infinite words or bi infinite sequences) play an important role in symbolic dynamics [16] and have also been studied in automata theory [18, 19] cellular automata [12], and the theory of codes [22, 5] We first introduce some notation, some of which is standard and can be found in [11] For single letters, that is, elements of Sigma, we use the lower case letters a; b; c; d. For finite words, we use the lower case letters t; u; v; w; x; y; z. For infinite ....
L. P. Hurd. Recursive cellular automata invariant sets. Complex Systems 4 (1990), 119--129.
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997) (7 citations) (Correct)
....a fixed point after one time step, so Omega 1 = Omega 1 = Pi 1 and are all described by the LLL where no adjacent pairs of 1 s are allowed. In general, if the limit set of a CA is described by an LLL, then it is reached at finite time. This was stated in [55] and shown for the 1 d case in [22]. The proof for arbitrary dimensions is essentially identical to that in one dimension, even though this case might seem more subtle because of the distinction between the defining LLL and the set of finite blocks that actually appear in infinite configurations. Proposition. If the limit ....
L.P. Hurd, "Recursive cellular automata invariant sets." Complex Systems 4 (1990) 119--129.
On Two-Sided Infinite Fixed Points of Morphisms - Jeffrey Shallit, Ming-wei Wang (1999) (Correct)
....fixed points of morphisms by characterizing the two sided infinite fixed points of h. Two sided infinite words (sometimes called bi infinite words or bi infinite sequences) play an important role in symbolic dynamics [13] and have also been studied in automata theory [14, 15] cellular automata [11], and the theory of codes [18, 5] We first introduce some notation, some of which is standard and can be found in [10] For single letters, that is, elements of Sigma, we use the lower case letters a; b; c; d. For finite words, we use the lower case letters t; u; v; w; x; y; z. For infinite ....
L. P. Hurd. Recursive cellular automata invariant sets. Complex Systems 4 (1990), 119--129.
Periodicity and Repetition in Combinatorics on Words - Wang (2004) (Correct)
No context found.
L. P. Hurd. Recursive cellular automata invariant sets. Complex Systems, 4:119-- 129, 1990.
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