Cellular automata on regular rooted trees
Formal Languages and Automata Theory
2012-10-01 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1205.6785,
title = {Cellular automata on regular rooted trees},
author = {Tullio Ceccherini-Silberstein and Michel Coornaert and Francesca Fiorenzi and Zoran Sunic},
journal= {arXiv preprint arXiv:1205.6785},
year = {2012}
}