GARDENS OF EDEN OF ELEMENTARY CELLULAR AUTOMATA.

Conference · Mon Jan 01 04:00:00 EST 2001

OSTI ID:975265

Barrett, C L ^[1]; Chen, W Y. C. ^[2]; Reidys, C M ^[3]

---

1. Christopher L.
2. William, Y. C.
3. Christian M.

Using de Bruijn graphs, we give a characterization of elementary cellular automata on the linear lattice that do not have any Gardens of Eden. It turns out that one can easily recoginze a CA that does not have any Gardens of Eden by looking at its de Bruijn graph. We also present a sufficient condition for the set of words accepted by a CA not to constitute a finite-complement language.

• Research Organization: Los Alamos National Laboratory
• Sponsoring Organization: DOE
• OSTI ID: 975265
• Report Number(s): LA-UR-01-1381
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
99 GENERAL AND MISCELLANEOUS
CALCULATION METHODS
IMAGES
PATTERN RECOGNITION