Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems

DOI10.1016/S0096-3003(97)10177-1zbMath0927.68057MaRDI QIDQ1294315

Andrew Adamatzky

Publication date: 29 June 1999

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

PHYSARUM SPATIAL LOGIC ⋮ Garden of Eden configurations for 2-D cellular automata with rule 2460 N ⋮ Space-time dynamic of normalized doxatons: Automata models of pathological collective mentality

Cites Work

• The constructibility of a configuration in a cellular automaton
• Invertible cellular automata: A review
• Certain relations between properties of maps of tessellation automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Condition for injectivity of global maps for tessellation automata
• Computational Analysis of One-Dimensional Cellular Automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems