Authors: Silvio Capobianco ; Jarkko Kari ; Siamak Taati

We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well known dual concept is pre-injectivity: a cellular automaton is pre-injective if distinct asymptotic configurations have distinct images. We prove that pre-injective, post-surjective cellular automata are reversible.
Moreover, on sofic groups, post-surjectivity alone implies reversibility. We also prove that reversible cellular automata over arbitrary groups are balanced, that is, they preserve the uniform measure on the configuration space.

Comment: 16 pages, 3 figures, LaTeX "dmtcs-episciences" document class. Final version for Discrete Mathematics and Theoretical Computer Science. Prepared according to the editor's requests