Open Access
2005 ON SURJUNCTIVITY OF THE TRANSITION FUNCTIONS OF CELLULAR AUTOMATA ON GROUPS
L. Yu. Glebsky, E. I. Gordon
Taiwanese J. Math. 9(3): 511-520 (2005). DOI: 10.11650/twjm/1500407858

Abstract

We give a simple proof of the fact that the following property: any injective transition function of a cellular automaton on a group $G$ is surjective, holds for any group $G$ approximable by amenable groups. For finitely generated groups this was proved by Gromov in [1]

Citation

Download Citation

L. Yu. Glebsky. E. I. Gordon. "ON SURJUNCTIVITY OF THE TRANSITION FUNCTIONS OF CELLULAR AUTOMATA ON GROUPS." Taiwanese J. Math. 9 (3) 511 - 520, 2005. https://doi.org/10.11650/twjm/1500407858

Information

Published: 2005
First available in Project Euclid: 18 July 2017

zbMATH: 1089.37006
MathSciNet: MR2162895
Digital Object Identifier: 10.11650/twjm/1500407858

Subjects:
Primary: 37B15

Keywords: cellular automata on groups , surjunctivity

Rights: Copyright © 2005 The Mathematical Society of the Republic of China

Vol.9 • No. 3 • 2005
Back to Top