The entropy and reversibility of cellular automata on Cayley tree

preprint2017arXivOpen access

Abstract

In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field Fp\mathbb F_p (the set of prime numbers modulo pp). We construct the rule matrix corresponding to finite cellular automata on Cayley tree. Further, we analyze the reversibility problem of this cellular automaton for some given values of a,b,c,d∈Fp∖{0}a,b,c,d\in \mathbb{F}_{p}\setminus \{0\} and the levels nn of Cayley tree. We compute the measure-theoretical entropy of the cellular automata which we define on Cayley tree. We show that for CAs on Cayley tree the measure entropy with respect to uniform Bernoulli measure is infinity.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.