Cellular automata on regular rooted trees
arXiv:1205.6785 · doi:10.1007/978-3-642-31606-7_9
Abstract
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.