2D cellular automata: dynamics and undecidability
Formal Languages and Automata Theory
2009-09-29 v2
Abstract
In this paper we introduce the notion of quasi-expansivity for 2D CA and we show that it shares many properties with expansivity (that holds only for 1D CA). Similarly, we introduce the notions of quasi-sensitivity and prove that the classical dichotomy theorem holds in this new setting. Moreover, we show a tight relation between closingness and openness for 2D CA. Finally, the undecidability of closingness property for 2D CA is proved.
Keywords
Cite
@article{arxiv.0906.0857,
title = {2D cellular automata: dynamics and undecidability},
author = {Enrico Formenti and Alberto Dennunzio and Michael Weiss},
journal= {arXiv preprint arXiv:0906.0857},
year = {2009}
}
Comments
24 pages, 12 figures. paper submitted to an international conference