On Gottschalk's Surjunctivity Conjecture for Non-Uniform Cellular Automata Preprint Version Information

EasyChair Preprint 15961

Abstract

Gottschalk's surjunctivity conjecture for a group G states that it is impossible for cellular automata (CA) over the universe $G$ with finite alphabet to produce strict embeddings of the full shift into itself. A group universe G satisfying Gottschalk's surjunctivity conjecture is called a surjunctive group. The surjunctivity theorem of Gromov and Weiss shows that every sofic group is surjunctive. In this paper, we study the surjunctivity of local perturbations of CA and more generally of non-uniform cellular automata (NUCA) with finite memory and uniformly bounded singularity over surjunctive group universes. In particular, we show that such a NUCA must be invertible whenever it is reversible. We also obtain similar results which extend to the class of NUCA a certain dual-surjunctivity theorem of Capobianco, Kari, and Taati for CA.

Keyphrases: Gottschalk's conjecture, Reversibility, asynchronous cellular automata, cellular automata, non-uniform cellular automata, sofic group, surjunctivity

@booklet{EasyChair:15961,
  author    = {Xuan Kien Phung},
  title     = {On Gottschalk's Surjunctivity Conjecture for Non-Uniform Cellular Automata  Preprint Version Information},
  howpublished = {EasyChair Preprint 15961},
  year      = {EasyChair, 2025}}