arXiv Analytics

Sign in

arXiv:math/0609015 [math.DS]AbstractReferencesReviewsResources

The Measure-Theoretical Entropy of a Linear Cellular Automata with respect to a Markov Measure

Hasan Akin

Published 2006-09-01Version 1

In this paper we study the measure-theoretical entropy of the one-dimensional linear cellular automata (CA hereafter) $T_{f[-l,r]}$, generated by local rule $f(x_{-l},...,x_{r})= \sum\limits_{i=-l}^{r}\lambda_{i}x_{i}(\text{mod}\ m)$, where $l$ and $r$ are positive integers, acting on the space of all doubly infinite sequences with values in a finite ring $\mathbb{Z}_{m}$, $m \geq 2$, with respect to a Markov measure. We prove that if the local rule $f$ is bipermutative, then the measure-theoretical entropy of linear CA $T_{f[-l,r]}$ with respect to a Markov measure $\mu_{\pi P}$ is $ h_{\mu_{\pi P}}(T_{f[-l,r]})=-(l+r)\sum\limits_{i,j=0}^{m-1}p_ip_{ij}\text{log} p_{ij}.$

Related articles: Most relevant | Search more
arXiv:1205.3960 [math.DS] (Published 2012-05-17)
A family of sand automata
arXiv:math/0211457 [math.DS] (Published 2002-11-29)
Projection of Markov measures may be Gibbsian
arXiv:2102.05539 [math.DS] (Published 2021-02-10)
On Mealy-Moore coding and images of Markov measures