The constructibility of a configuration in a cellular automaton
From MaRDI portal
Publication:758953
DOI10.1016/S0022-0000(73)80004-2zbMATH Open0271.94037MaRDI QIDQ758953FDOQ758953
Authors: Takeo Yaku 
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)
Cites Work
- Title not available (Why is that?)
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Title not available (Why is that?)
- Simple Computation-Universal Cellular Spaces
- Title not available (Why is that?)
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- 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
- The Garden-of-Eden Theorem for Finite Configurations
- Structural and behavioral equivalences of tessellation automata
Cited In (14)
- Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata
- Two-dimensional cellular automata
- Classifying circular cellular automata
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
- Computations on nondeterministic cellular automata
- Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
- Recursive paths in cross-connected trees and an application to cell spaces
- Computation theory of cellular automata
- On ergodic one-dimensional cellular automata
- Survey of research in the theory of homogeneous structures and their applications
- The general \(\sigma \) all-ones problem for trees
- Strong surjectivity is equivalent to C-injectivity
- The behavioral properties of homogeneous structures
This page was built for publication: The constructibility of a configuration in a cellular automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758953)
