The constructibility of a configuration in a cellular automaton
From MaRDI portal
Publication:758953
DOI10.1016/S0022-0000(73)80004-2zbMath0271.94037MaRDI QIDQ758953
Publication date: 1973
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items
Strong surjectivity is equivalent to C-injectivity ⋮ The general \(\sigma \) all-ones problem for trees ⋮ Survey of research in the theory of homogeneous structures and their applications ⋮ The behavioral properties of homogeneous structures ⋮ Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata ⋮ Two-dimensional cellular automata ⋮ On ergodic one-dimensional cellular automata ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ Computations on nondeterministic cellular automata ⋮ Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems ⋮ Recursive paths in cross-connected trees and an application to cell spaces ⋮ Inverse and Injectivity of Parallel Relations Induced by Cellular Automata ⋮ Classifying circular cellular automata ⋮ Computation theory of cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some clarifications of the concept of a Garden-of-Eden configuration
- A completeness problem for pattern generation in tessellation automata
- Tessellation structures for reproduction of arbitrary patterns
- Pattern reproduction in tessellation automata of arbitrary dimension
- Some regular state sets in the system of one-dimensional iterative automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- The Garden-of-Eden Theorem for Finite Configurations
- Simple Computation-Universal Cellular Spaces
- Structural and behavioral equivalences of tessellation automata
This page was built for publication: The constructibility of a configuration in a cellular automaton
