Induction and restriction of cellular automata
From MaRDI portal
Publication:3625414
DOI10.1017/S0143385708080437zbMath1160.37317OpenAlexW2158602175MaRDI QIDQ3625414
Michel Coornaert, Tullio G. Ceccherini Silberstein
Publication date: 5 May 2009
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0143385708080437
Related Items (14)
A Garden of Eden theorem for linear subshifts ⋮ On the image set and reversibility of shift morphisms over discrete alphabets ⋮ On the reversibility and the closed image property of linear cellular automata ⋮ Graph subshifts ⋮ On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups ⋮ On invertible and stably reversible non-uniform cellular automata ⋮ The Myhill property for strongly irreducible subshifts over amenable groups ⋮ A notion of effectiveness for subshifts on finitely generated groups ⋮ The large scale geometry of strongly aperiodic subshifts of finite type ⋮ Surjunctivity and Reversibility of Cellular Automata over Concrete Categories ⋮ On injective endomorphisms of symbolic schemes ⋮ On linear shifts of finite type and their endomorphisms ⋮ On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems ⋮ Expansive actions on uniform spaces and surjunctive maps
Cites Work
- A generalization of the Curtis-Hedlund theorem
- Amenable groups and cellular automata
- Endomorphisms of symbolic algebraic varieties
- Injective linear cellular automata and sofic groups
- The Garden of Eden theorem for linear cellular automata
- Amenability and Linear Cellular Automata Over Semisimple Modules of Finite Length
- Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
This page was built for publication: Induction and restriction of cellular automata
