Topological properties of cellular automata on trees
Formal Languages and Automata Theory
2012-08-15 v1 Computational Complexity
Discrete Mathematics
Cellular Automata and Lattice Gases
Abstract
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.
Keywords
Cite
@article{arxiv.1208.2766,
title = {Topological properties of cellular automata on trees},
author = {Gabriele Fici and Francesca Fiorenzi},
journal= {arXiv preprint arXiv:1208.2766},
year = {2012}
}
Comments
In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498