On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
From MaRDI portal
Publication:1041034
DOI10.1016/j.ic.2009.02.006zbMath1192.68439arXiv0711.3841MaRDI QIDQ1041034
Publication date: 27 November 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0711.3841
68Q80: Cellular automata (computational aspects)
Related Items
Generalized Besicovitch and Weyl spaces: topology, patterns, and sliding block codes, An “almost dual” to Gottschalk’s Conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Invertible cellular automata: A review
- Amenable groups and cellular automata
- Cellular automata and strongly irreducible shifts of finite type.
- Simulations between cellular automata on Cayley graphs
- Tesselations with local transformations
- Induced Subshifts and Cellular Automata
- Induction and restriction of cellular automata
- An Introduction to Symbolic Dynamics and Coding
- Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Endomorphisms and automorphisms of the shift dynamical system