On Nilpotency and Asymptotic Nilpotency of Cellular Automata
classification
🧮 math.DS
cs.FLnlin.CG
keywords
nilpotencyautomatacellularsubshiftsasymptoticbrieflycellsconjecture
read the original abstract
We prove a conjecture of P. Guillon and G. Richard by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S^Z^d for all d. We also briefly discuss nilpotency on other subshifts, and show that weak nilpotency implies nilpotency in all subshifts and all dimensions, since we do not know a published reference for this.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.