Algorithms for computing preimages of cellular automata configurations
From MaRDI portal
Recommendations
- Cellular Automata Preimages: Count and List Algorithm
- Counting preimages of homogeneous configurations in 1-dimensional cellular automata
- Predecessors of cellular automata states. II: Pre-images of finite sequences
- scientific article; zbMATH DE number 21231
- scientific article; zbMATH DE number 4201650
Cites work
Cited in
(11)- Predecessor states for certain cellular automata evolutions
- Predecessors of cellular automata states. II: Pre-images of finite sequences
- Pre-expansivity in cellular automata
- CALCULATING ANCESTORS IN ONE-DIMENSIONAL CELLULAR AUTOMATA
- Computation of explicit preimages in one-dimensional cellular automata applying the De Bruijn diagram
- Counting preimages of homogeneous configurations in 1-dimensional cellular automata
- scientific article; zbMATH DE number 21231 (Why is no real title available?)
- The enumeration of preimages and gardens-of-Eden in sequential cellular automata
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- Cellular Automata Preimages: Count and List Algorithm
- Computing the periods of preimages in surjective cellular automata
This page was built for publication: Algorithms for computing preimages of cellular automata configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383550)