Cellular automata on regular rooted trees
classification
💻 cs.FL
cs.DM
keywords
automatacellularregularrootedshiftssofictreetrees
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.