In this paper we study some decidable properties of two-dimensional 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

Dennunzio, A., Formenti, E. (2008). Decidable properties of 2D cellular automata. In Developments in Language Theory, 12th International Conference, DLT 2008 (pp.264-275). Springer [10.1007/978-3-540-85780-8].

Decidable properties of 2D cellular automata

Dennunzio, A;
2008

Abstract

In this paper we study some decidable properties of two-dimensional 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
No
paper
cellular automata, decidability, symbolic dynamics
English
International Conference on Developments in Language Theory SEP 16-19
978-3-540-85779-2
Dennunzio, A., Formenti, E. (2008). Decidable properties of 2D cellular automata. In Developments in Language Theory, 12th International Conference, DLT 2008 (pp.264-275). Springer [10.1007/978-3-540-85780-8].
Dennunzio, A; Formenti, E
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/14825
Citazioni
  • Scopus 20
  • ???jsp.display-item.citation.isi??? 17
Social impact