Cellular automata on regular rooted trees
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, and Zoran Sunic
TL;DR
This paper explores cellular automata on regular rooted trees, focusing on characterizing sofic tree shifts with automata and determining the decidability of surjectivity for these automata.
Contribution
It introduces a characterization of sofic tree shifts via unrestricted Rabin automata and proves the decidability of surjectivity for cellular automata between such shifts.
Findings
Sofic tree shifts characterized by unrestricted Rabin automata
Decidability of surjectivity problem established
Advances understanding of cellular automata on tree structures
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.