Some clarifications of the concept of a Garden-of-Eden configuration

DOI10.1016/S0022-0000(75)80015-8zbMath0348.94056MaRDI QIDQ1234652

Serafino Amoroso, Gerald Cooper, Yale N. Patt

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

Predecessors of cellular automata states. II: Pre-images of finite sequences ⋮ The Moore-Myhill pseudo tiling for the Heisenberg tessellation automata ⋮ Garden of Eden configurations for 2-D cellular automata with rule 2460 N ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ On behavior of two-dimensional cellular automata with an exceptional rule ⋮ The constructibility of a configuration in a cellular automaton ⋮ Amenable groups and cellular automata ⋮ Recursive paths in cross-connected trees and an application to cell spaces ⋮ Invertible cellular automata: A review

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Classes of languages and linear-bounded automata

This page was built for publication: Some clarifications of the concept of a Garden-of-Eden configuration