Non-Uniform Cellular Automata: classes, dynamics, and decidability
Formal Languages and Automata Theory
2011-07-27 v1 Dynamical Systems
Cellular Automata and Lattice Gases
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
Cite
@article{arxiv.1107.5228,
title = {Non-Uniform Cellular Automata: classes, dynamics, and decidability},
author = {Alberto Dennunzio and Enrico Formenti and Julien Provillard},
journal= {arXiv preprint arXiv:1107.5228},
year = {2011}
}
Comments
Paper submitted to an international journal on June 9, 2011. This is an extended and improved version of the conference paper: G. Cattaneo, A. Dennunzio, E. Formenti, and J. Provillard. "Non-uniform cellular automata". In Proceedings of LATA 2009, volume 5457 of Lecture Notes in Computer Science, pages 302-313. Springer