%0 Journal Article
%T Cellular automata on regular rooted trees
%A Tullio Ceccherini-Silberstein
%A Michel Coornaert
%A Francesca Fiorenzi
%A Zoran Sunic
%J Computer Science
%D 2012
%I arXiv
%R 10.1007/978-3-642-31606-7_9
%X We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.
%U http://arxiv.org/abs/1205.6785v1