The Garden-of-Eden Theorem for Finite Configurations
From MaRDI portal
Publication:5623670
DOI10.2307/2036824zbMath0219.02025OpenAlexW4230725111MaRDI QIDQ5623670
Serafino Amoroso, Gerald Cooper
Publication date: 1970
Full work available at URL: https://doi.org/10.2307/2036824
Combinatorial aspects of tessellation and tiling problems (05B45) Foundations of classical theories (including reverse mathematics) (03B30)
Related Items (21)
An interconnection of local maps inducing onto global maps ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Reversible computing and cellular automata -- a survey ⋮ The reversibility problem for a family of two-dimensional cellular automata ⋮ Survey of research in the theory of homogeneous structures and their applications ⋮ Reproduction in tessellation structures ⋮ On reversibility in cellular automata ⋮ Garden of Eden configurations for 2-D cellular automata with rule 2460 N ⋮ Certain relations between properties of maps of tessellation automata ⋮ Local maps inducing surjective global maps of one-dimensional tessellation automata ⋮ On behavior of two-dimensional cellular automata with an exceptional rule ⋮ Injectivity and surjectivity of parallel maps for cellular automata ⋮ Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration ⋮ The constructibility of a configuration in a cellular automaton ⋮ Tessellation structures for reproduction of arbitrary patterns ⋮ Confusion in the Garden of Eden ⋮ Tesselations with local transformations ⋮ Recursive paths in cross-connected trees and an application to cell spaces ⋮ Unnamed Item ⋮ Linear cellular automata over \(Z_ m\) ⋮ Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
Cites Work
This page was built for publication: The Garden-of-Eden Theorem for Finite Configurations
