Showing math.GRShow all
2 papers · 1 filter
math.GR2026
Self-simulability of graph products
Kanéda Blot, Ville Salo
A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a gr…
math.GR2025
Word problems and embedding-obstructions in cellular automata groups on groups
Ville Salo
We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that wo…