Francesca Fiorenzi (LRI, Orsay)

In this talk we illustrate some results about cellular automata on a finitely generated free monoid, that is, on a regular rooted tree. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity and injectivity problem for cellular automata between sofic tree shifts. Moreover, we investigate some topological properties of these automata.