On the composition of cellular automata
From MaRDI portal
Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites work
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- A secret sharing scheme based on cellular automata
- Ancestors, descendants, and gardens of Eden in reaction systems
- CELLULAR AUTOMATA AND LATTICE BOLTZMANN TECHNIQUES: AN APPROACH TO MODEL AND SIMULATE COMPLEX SYSTEMS
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Computing issues of asynchronous CA
- Computing with membranes
- Dynamical properties of expansive one-sided cellular automata
- From one-dimensional to two-dimensional cellular automata
- Guided tour of asynchronous cellular automata
- scientific article; zbMATH DE number 5291271 (Why is no real title available?)
- scientific article; zbMATH DE number 44378 (Why is no real title available?)
- scientific article; zbMATH DE number 1886324 (Why is no real title available?)
- scientific article; zbMATH DE number 3205673 (Why is no real title available?)
- Linear cellular automata over \(Z_ m\)
- Non-uniform Cellular Automata
- Periodic orbits and dynamical complexity in cellular automata
- Reaction systems
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Solution of some conjectures about topological properties of linear cellular automata
- Theory of cellular automata: a survey
This page was built for publication: On the composition of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348961)
