2000 character limit reached
2D cellular automata: dynamics and undecidability (0906.0857v2)
Published 4 Jun 2009 in cs.FL
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.