Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) |
scientific article |
Statements
Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (English)
0 references
23 November 2021
0 references
cellular automata
0 references
linear cellular automata
0 references
decidability
0 references
symbolic dynamics
0 references
complex systems
0 references
0 references
0 references
0 references
