Michael D. Taylor, "Weak gardens of Eden for 1-dimensional tessellation automata", International Journal of Mathematics and Mathematical Sciences, vol. 8, Article ID 453232, 9 pages, 1985. https://doi.org/10.1155/S0161171285000631
Weak gardens of Eden for 1-dimensional tessellation automata
If is the parallel map associated with a -dimensional tessellation automaton, then we say a configuration is a weak Garden of Eden for if has no pre-image under other than a shift of itself. Let the set of weak Gardens of Eden for and the set of Gardens of Eden (i.e., the set of configurations not in the range of ). Typically members of satisfy an equation of the form where is the shift defined by . Subject to a mild restriction on , the equation always has a solution , and all such solutions are periodic. We present a few other properties of weak Gardens of Eden and a characterization of for a class of parallel maps we call -characteristic transformations in the case where there are at least three cell states.
Copyright © 1985 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.