Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-07-26
Computer Science
Formal Languages and Automata Theory
Paper submitted to an international journal on June 9, 2011. This is an extended and improved version of the conference paper:
Scientific paper
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.
Dennunzio Alberto
Formenti Enrico
Provillard Julien
No associations
LandOfFree
Non-Uniform Cellular Automata: classes, dynamics, and decidability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Non-Uniform Cellular Automata: classes, dynamics, and decidability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-Uniform Cellular Automata: classes, dynamics, and decidability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-93843