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

DOI10.1016/S0022-0000(75)80015-8zbMATH Open0348.94056MaRDI QIDQ1234652FDOQ1234652

Authors: 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)

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

Cited In (9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234652)