Edge Cellular Automata
J. Gravner and D. Griffeath
The latest version of the
paper
Robust periodic solutions and evolution from seeds in one-dimensional edge cellular automata.
This work was partially supported by the National Science Foundation
and the Republic of Slovenia′s Ministry of Science.
Links to cellular automata simulation software:
MCell,
Golly.
The Stage I label tree text files below list each
numbered node, its generations, parent and children
(if any), its label, and, when it is a leaf, reason for no children.
When the final Stage I tree exists, we also provide its picture.
Output of an R-algorithm is in the RPS information files. For each entry,
the first line includes the handle and link sizes, and the density
of the pattern. The following
lines form an rle input file, recognized by
Golly, and
ending with !.
The rest of the entry gives binary handle+link data for each
of the π temporal shifts. (Here, π is not reduced so any file
includes RPS of all lower temporal periods.)
Range 2 examples (in parentheses,
Wofram code for the
elementary cellular automaton with the listed left edge dynamics);
the red letter that follows indicates the class (see Section 8 of the paper):
- E000 (Rule 2) B
- E001 (Rule 194) B
- E00D (Rule 66) B
- E00E (Rule 130) B
- E010 (Rule 50) P
- E011 (Rule 242) P
- E01D (Rule 114) P
- E01E (Rule 178) P
- E0D0 (Rule 18) R
- E0D1 (Rule 210) R
- E0DD (Rule 82) R
- E0DE (Rule 146) R
- E0E0 (Rule 34) B
- E0E1 (Rule 226) B
- E0ED (Rule 98) B
- E0EE (Rule 162) B
- E100 (Rule 14) B
- E101 (Rule 206) P
- E10D (Rule 78) P
- E10E (Rule 142) B
- E110 (Rule 62) P
- E111 (Rule 254) P
- E11D (Rule 126) R
- E11E (Rule 190) P
- E1D0 (Rule 30) C
- E1D1 (Rule 222) P
- E1DD (Rule 94) C
- E1DE (Rule 158) P
- E1E0 (Rule 46) B
- E1E1 (Rule 238) P
- E1ED (Rule 110) C
- E1EE (Rule 174) B
- ED00 (Rule 6) B
- ED01 (Rule 198) P
- ED0D (Rule 70) P
- ED0E (Rule 134) B
- ED10 (Rule 54) C
- ED11 (Rule 246) P
- ED1D (Rule 118) P
- ED1E (Rule 182) R
- EDD0 (Rule 22) C
- EDD1 (Rule 214) P
- EDDD (Rule 86) C
- EDDE (Rule 150) R
- EDE0 (Rule 38) B
- EDE1 (Rule 230) P
- EDED (Rule 102) R
- EDEE (Rule 166) B
- EE00 (Rule 10) B
- EE01 (Rule 202) P
- EE0D (Rule 74) B
- EE0E (Rule 138) B
- EE10 (Rule 58) P
- EE11 (Rule 250) P
- EE1D (Rule 122) R
- EE1E (Rule 186) P
- EED0 (Rule 26) R
- EED1 (Rule 218) P
- EEDD (Rule 90) R
- EEDE (Rule 154) R
- EEE0 (Rule 42) B
- EEE1 (Rule 234) P
- EEED (Rule 106) C
- EEEE (Rule 170) B
Range 3 totalistic examples:
- Tot 1
- Tot 12
- Tot 14
- Tot 124
- Tot 134