Abstract
We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide an easy-to-check necessary and sufficient condition for a D-dimensional linear cellular automata over Zm to be ergodic and topologically transitive. As a byproduct, we get that for linear cellular automata ergodicity is equivalent to topological transitivity. Finally, we prove that for 1-dimensional linear cellular automata over Zm, regularity (denseness of periodic orbits) is equivalent to surjectivity.
| Original language | English |
|---|---|
| Pages (from-to) | 147-164 |
| Number of pages | 18 |
| Journal | Theoretical Computer Science |
| Volume | 233 |
| Issue number | 1-2 |
| DOIs | |
| Publication status | Published - 28 Feb 2000 |
| Externally published | Yes |
Keywords
- Cellular automata
- Discrete time dynamical systems
- Ergodicity
- Topological transitivity
Fingerprint
Dive into the research topics of 'Ergodicity, transitivity, and regularity for linear cellular automata over Zm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver