A method to identify the invariant subsets of bi‐infinite configurations of cellular automata that propagate rigidly with a constant velocity ν is described. Causal traveling configurations, propagating at speeds not greater than the automaton range, |ν|≤r, are considered. The sets of traveling configurations are presented by finite automata and its topological entropy is calculated. When the invariant subset of traveling configurations has nonzero topological entropy, the dynamics is dominated by the interaction of domains, composed of traveling patterns of finite size. The sets of traveling patterns and domains are presented by finite automata. End‐resolving CA are shown to always have sets of traveling configurations that are spatially periodic with zero entropy, except possibly for traveling configurations at top speed. The elementary CA are examined exhaustively along these lines.

1.
P.
Grassberger
, “
New mechanism for deterministic diffusion
,”
Phys. Rev. A
28
,
3666
(
1984
).
2.
J.
Krug
and
H.
Spohn
, “
Universality classes for deterministic surface growth
,”
Phys. Rev.
38
,
4271
(
1988
).
3.
N.
Boccara
,
J.
Nasser
, and
M.
Roger
, “
Particle-like structures and their interactions in spatio-temporal patterns generated by one-dimensional deterministic cellular automaton rules
,”
Phys. Rev. A
44
,
866
(
1991
).
4.
J. P.
Crutchfield
and
J. E.
Hanson
, “
Attractor vicinity decay for a cellular automaton
,”
Chaos
3
,
215
(
1993
).
5.
E. Jen, “Transience and dislocations in one-dimensional cellular automata,” in Cellular Automata and Cooperative Systems, edited by N. Boccara et al. (Kluwer Academic, London, 1991).
6.
J. E.
Hanson
and
J. P.
Crutchfield
, “
The attractor-basin portrait of a cellular automaton
,”
J. Stat. Phys.
66
,
1415
(
1992
).
7.
J. P.
Crutchfield
and
J. E.
Hanson
, “
Turbulent pattern bases for cellular automata
,”
Physica D
69
,
279
(
1993
).
8.
A.
Maass
, “
On the sofic limit sets of cellular automata
,”
Ergod. Th. Dynam. Syst.
15
,
663
(
1995
).
9.
G. A.
Hedlund
, “
Endomorphisms and automorphisms of the shift dynamical system
,”
Math. Syst. Th.
3
,
320
(
1969
).
10.
A general approach of hierarchical modeling is introduced and formalized in
J. P.
Crutchfield
, “
The calculi of emergence: computation, dynamics and induction
,”
Physica D
75
,
11
(
1994
).
11.
Y.
Aizawa
,
I.
Nishikawa
, and
K.
Kaneko
, “
Soliton turbulence in one-dimensional cellular automata
,”
Physica D
45
,
307
(
1990
).
12.
E. M.
Coven
and
M. E.
Paul
, “
Sofic systems
,”
Israel J. Math.
20
,
165
(
1975
).
13.
H, Gutowitz, “Cryptography with dynamical systems,” in Cellular Automata and Cooperative Systems, edited by N. Boccara et al. (Kluwer Academic, London, 1991).
14.
K.
Eloranta
, “
Partially permutative cellular automata
,”
Nonlinearity
6
,
1009
(
1993
).
15.
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, MA, 1987).
16.
S.
Wolfram
, “
Computation theory of cellular automata
,”
Commun. Math. Phys.
96
,
15
(
1984
).
17.
E.
Ugalde
and
J.
Urias
, “
Symmetry groups of automata
,”
Physica D
70
,
178
(
1994
).
18.
K.
Sutner
, “
Complex Systems, De Bruijn graphs and linear cellular automata
,”
Complex Systems
5
,
19
(
1991
).
19.
R.
Fisher
, “
Sofic systems and graphs
,”
Monatsh. Math.
80
,
179
(
1975
).
20.
J.
Urías
, “
Arithmetic representations of cellular automata
,”
Physica D
68
,
437
(
1993
).
21.
B.
Weiss
, “
Subshifts of finite type and sofic systems
,”
Monatsh. Math.
77
,
462
(
1973
).
22.
M.
Mitchell
,
J. P.
Crutchfield
, and
P. T.
Hraber
, “
Evolving cellular automata to perform computations: mechanisms and impediments
,”
Physica D
75
,
361
(
1994
).
23.
L. P. Hurd, “Rule forms and equivalencies,” in Theory and Applications of Cellular Automata, edited by S. Wolfram (World Scientific, Singapore, 1986), pp. 487–492.
This content is only available via PDF.
You do not currently have access to this content.