The Measure-Theoretical Entropy of a 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) Tf[-l,r], generated by local rule f(x-l,...,xr)= Σi=-lrλixi(mod\ m), where l and r are positive integers, acting on the space of all doubly infinite sequences with values in a finite ring Zm, m ≥ 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 Tf[-l,r] with respect to a Markov measure μπ P is hμπ P(Tf[-l,r])=-(l+r)Σi,j=0m-1pipijlog pij.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…