Cellular automata on a $G$-set
Dynamical Systems
2011-05-27 v1
Abstract
We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition also allows to deal with maps, intuitively considered as cellular automata, even if they did not match the usual definition, like the Margolus billiard-ball. One of the main results is an extension of Hedlund's theorem for these cellular automata.
Cite
@article{arxiv.1105.5335,
title = {Cellular automata on a $G$-set},
author = {Sébastien Moriceau},
journal= {arXiv preprint arXiv:1105.5335},
year = {2011}
}