The Garden of Eden Theorem for Cellular Automata on Group Sets
We prove the Garden of Eden theorem for cellular automata with finite set of states and finite neighbourhood on right amenable left homogeneous spaces with finite stabilisers. It states that the global transition function of such an automaton is surjective if and only if it is pre-injective. Pre-Injectivity means that two global configurations that differ at most on a finite subset and have the same image under the global transition function must be identical.
KeywordsCellular automata Group actions Garden of Eden theorem
- 1.Ceccherini-Silberstein, T., Coornaert, M.: Cellular Automata and Groups. Springer Monographs in Mathematics. Springer, Heidelberg (2010)Google Scholar
- 2.Moore, E.F.: Machine models of self-reproduction. In: Proceedings of Symposia in Applied Mathematics, vol. 14, pp. 17–33 (1962)Google Scholar
- 6.Wacker, S.: Right Amenable Left Group Sets and the Tarski-Følner Theorem [math.GR]. arXiv:1603.06460