GARDENS OF EDEN OF ELEMENTARY CELLULAR AUTOMATA.perBarrett, C. L. (Christopher L.)perChen, W. Y. C. (William, Y. C.)perReidys, C. M. (Christian M.)orgUnited States. Department of Energy.United StatesLos Alamos National Laboratory2001-01-01engUsing 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.11 p.ImagesPattern Recognition99 General And Miscellaneous//Mathematics, Computing, And Information ScienceCalculation Methods97 Mathematical Methods And Computing