On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract)

Maurice Margenstern

In this paper, we look at the following question. We consider cellular automata in the hyperbolic plane, (see Margenstern, 2000, 2007 and Margenstern, Morita, 2001) and we consider the global function defined on all possible configurations. Is the injectivity of this function undecidable? The problem was answered positively in the case of the Euclidean plane by Jarkko Kari, in 1994. In the present paper, we show that the answer is also positive for the hyperbolic plane: the problem is undecidable.

In Turlough Neary, Damien Woods, Tony Seda and Niall Murphy: Proceedings International Workshop on The Complexity of Simple Programs (CSP 2008), Cork, Ireland, 6-7th December 2008, Electronic Proceedings in Theoretical Computer Science 1, pp. 153–163.
Published: 25th June 2009.

ArXived at: https://dx.doi.org/10.4204/EPTCS.1.15 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org