| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437175 | Theoretical Computer Science | 2006 | 6 Pages |
Abstract
It is shown that the set of periods of any additive cellular automata F, where the addition is done modulo a prime p, can be determined using some simple conditions on the coefficients in the linear expression of F. In particular, we establish that the set of periods has only four possibilities: {1,m} for some m where 1⩽m
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
