English

The Myhill property for cellular automata on amenable semigroups

Dynamical Systems 2015-05-06 v3 Functional Analysis Group Theory

Abstract

Let SS be a cancellative left-amenable semigroup and let AA be a finite set. We prove that every pre-injective cellular automaton τ ⁣:ASAS\tau \colon A^S \to A^S is surjective.

Cite

@article{arxiv.1302.5965,
  title  = {The Myhill property for cellular automata on amenable semigroups},
  author = {Tullio Ceccherini-Silberstein and Michel Coornaert},
  journal= {arXiv preprint arXiv:1302.5965},
  year   = {2015}
}
R2 v1 2026-06-21T23:31:50.687Z