The measure-theoretic entropy of linear cellular automata with respect to a Markov measure

Abstract: 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}) = s u m l i m i t s_{i = - l}^{r} l a m b d a_{i} x_{i} (e x t m o d m)

, where

l

and

r

are positive integers, acting on the space of all doubly infinite sequences with values in a finite ring

m a t h b b Z_{m}

,

m g e q 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

m u_{p i P}

is

h_{m u_{p i P}} (T_{f [- l, r]}) = - (l + r) s u m l i m i t s_{i, j = 0}^{m - 1} p_{i} p_{i j} e x t l o g p_{i j} .

Cited In (2)

This page was built for publication: The measure-theoretic entropy of linear cellular automata with respect to a Markov measure