| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426573 | Information and Computation | 2012 | 15 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
