  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.
