On Nilpotency and Asymptotic Nilpotency of Cellular Automata
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 di...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2012-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1205.6714v2 |