2000 character limit reached
Cellular automata on regular rooted trees (1205.6785v1)
Published 30 May 2012 in cs.FL and cs.DM
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.