An Easy to Check Characterization of Positive Expansivity for Additive Cellular Automata Over a Finite Abelian Group
Abstract
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. First of all, an easily checkable characterization of positive expansivity is provided for the non trivial subclass of Linear Cellular Automata over the alphabet $(\Z/m\Z)^n$. Then, we show how it can be exploited to decide positive expansivity for the whole class of Additive Cellular Automata over a finite abelian group.
- Publication:
-
IEEE Access
- Pub Date:
- 2023
- DOI:
- 10.1109/ACCESS.2023.3328540
- arXiv:
- arXiv:2308.03064
- Bibcode:
- 2023IEEEA..11l1246D
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory
- E-Print:
- 12 pages