Predecessors of cellular automata states. II: Pre-images of finite sequences
From MaRDI portal
Publication:1341839
DOI10.1016/0167-2789(94)90230-5zbMath0820.68083OpenAlexW2027987935MaRDI QIDQ1341839
Publication date: 9 January 1995
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-2789(94)90230-5
Cellular automata (computational aspects) (68Q80) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Predecessors of cellular automata states. III: Garden of Eden classification of cellular automata ⋮ Algorithms for computing preimages of cellular automata configurations ⋮ Graph-theoretical characterization of invertible cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Predecessors of cellular automata states. I: Additive automata
- Wolfram's class IV automata and a good Life
- Invertible cellular automata: A review
- Nearest neighbor cellular automata over \(Z_ 2\) with periodic boundary conditions
- Computation theory of cellular automata
- Predecessor states for certain cellular automata evolutions
- Cylindrical cellular automata
- The principal part of a block map
- Some clarifications of the concept of a Garden-of-Eden configuration
- Injectivity and surjectivity of parallel maps for cellular automata
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Confusion in the Garden of Eden
- De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science
- The Sums of Powers Theorem for Commuting Block Maps
- Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
- The Commuting Block Maps Problem
This page was built for publication: Predecessors of cellular automata states. II: Pre-images of finite sequences