Entropy of additive cellular automata

From MaRDI portal





The purpose of this paper is to derive entropy formulas for al nearest neighbor additive cellular automata defined over \({\mathbb{Z}}_ p\), where p is prime, to indicate which finite automata do and which do not decrease entropy, and to explain the reason that infinite automata do not decrease entropy.











This page was built for publication: Entropy of additive cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582910)