Garden of Eden configurations for cellular automata on Cayley graphs of groups
SIAM Journal on Discrete Mathematics
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Cellular automata and strongly irreducible shifts of finite type
Theoretical Computer Science
Tessellations with local transformations
Journal of Computer and System Sciences
Hi-index | 0.00 |
Given a shift subspace over a finitely generated group, we define the subshift induced by it on a larger group. Then we do the same with cellular automata and, while observing that the new automaton can model a different abstract dynamics, we remark several properties that are shared with the old one. After that, we simulate the old automaton inside the new one, and discuss some consequences and restrictions.