Non-uniform cellular automata: Classes, dynamics, and decidability

https://doi.org/10.1016/j.ic.2012.02.008Get rights and content
Under an Elsevier user license
open archive

Abstract

The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjectivity and injectivity is also established. The final part studies a strong form of equicontinuity property specially suited for non-uniform cellular automata.

Keywords

Cellular automata
Non-uniform cellular automata
Decidability
Symbolic dynamics

Cited by (0)

This is an extended and improved version of the paper by Cattaneo et al. (2009) [2] presented at LATA2009 conference.