Universal pattern generation by cellular automata
From MaRDI portal
Publication:418784
DOI10.1016/j.tcs.2011.12.037zbMath1238.68089WikidataQ62045922 ScholiaQ62045922MaRDI QIDQ418784
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.037
68Q80: Cellular automata (computational aspects)
Related Items
Cellular automata and powers of p∕q, Transitive action on finite points of a full shift and a finitary Ryan’s theorem, One-dimensional pattern generation by cellular automata, On computing the Lyapunov exponents of reversible cellular automata, One-dimensional pattern generation by cellular automata, A one-dimensional physically universal cellular automaton, On the trace subshifts of fractional multiplication automata, Pre-expansivity in cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamical properties of expansive one-sided cellular automata
- Theory of cellular automata: a survey
- ×2 and ×3 invariant measures and entropy
- The 3x + 1 Problem and Its Generalizations
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation