Decidable properties of 2D cellular automata

Enrico Formenti (1) , Alberto Dennunzio (2)

1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3
2 DISCo - Dipartimento di Informatica Sistemistica e Comunicazione

In this paper we study some decidable properties of twodimensional cellular automata (2D CA). The notion of closingness is generalized to the 2D case and it is linked to permutivity and openness. The major contributions of this work are two deep constructions which have been fundamental in order to prove our new results and we strongly believe it will be a valuable tool for proving other new ones in the near future.

Mots clés: Cellular Automata; Decidability; Closingness; Opennes

Domaines: Complexité [cs.CC]; Modélisation et simulation; Systèmes dynamiques [math.DS]; Automates cellulaires et gaz sur réseau [nlin.CG]; Dynamique Chaotique [nlin.CD]

Enrico Formenti, Alberto Dennunzio. Decidable properties of 2D cellular automata. DEVELOPMENTS IN LANGUAGE THEORY (DLT 2008), Sep 2008, Kioto, Japan. pp.264-275. ⟨hal-00310411⟩