1 Cellular automata over shifts and subshifts: Garden of Eden theorems and surjunctivity
Tullio G. Ceccherini-Silberstein, Michel Coornaert, Xuan Kien Phung · 2024
This is a survey discussing some recent developments in the theory of cellular automata over shifts and subshifts on groups. The alphabet may be finite or infinite. In the infinite alphabet case, we consider linear cellular automata as well as algebraic cellular automata. We discuss various versions of the Garden of Eden theorem and results related to surjunctivity and Kaplansky conjectures.