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

Authors:
Alberto Dennunzio;Enrico Formenti;Julien Provillard
Affiliations:
Universití degli studi di Milano-Bicocca, Dipartimento di Informatica Sistemistica e Comunicazione, viale Sarca 336, 20126 Milano, Italy;Université Nice-Sophia Antipolis, Laboratoire I3S, 2000 Route des Colles, 06903 Sophia Antipolis, France;Université Nice-Sophia Antipolis, Laboratoire I3S, 2000 Route des Colles, 06903 Sophia Antipolis, France
Venue:
Information and Computation
Year:
2012

Citing 9
Cited 5

Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
On the dynamical behavior of chaotic cellular automata

Theoretical Computer Science - Special issue: cellular automata
Decidable Properties of 2D Cellular Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Non-uniform Cellular Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Conservation of some dynamical properties for operations on cellular automata

Theoretical Computer Science
Sand automata as cellular automata

Theoretical Computer Science
On the directional dynamics of additive cellular automata

Theoretical Computer Science
On the undecidability of the limit behavior of Cellular Automata

Theoretical Computer Science
Computational complexity of rule distributions of non-uniform cellular automata

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

Local rule distributions, language complexity and non-uniform cellular automata

Theoretical Computer Science
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues

Theoretical Computer Science
An experimental study of noise and asynchrony in elementary cellular automata with sampling compensation

Natural Computing: an international journal
m-Asynchronous cellular automata: from fairness to quasi-fairness

Natural Computing: an international journal
Computing Issues of Asynchronous CA

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.