arXiv:1211.7362 [math.DS]AbstractReferencesReviewsResources
The entropy and reversibility of cellular automata on Cayley tree
Published 2012-11-30, updated 2017-11-12Version 2
In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field $\mathbb F_p$ (the set of prime numbers modulo $p$). 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\in \mathbb{F}_{p}\setminus \{0\}$ and the levels $n$ 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.
Comments: 13 pages, 4 figures, the paper has been improved, and fixed some gramatical mistakes
Related articles: Most relevant | Search more
arXiv:1610.09466 [math.DS] (Published 2016-10-29)
The Dynamics of The Potts-Bethe Mapping over $\mathbb{Q}_p:$ The Case $p\equiv 2 \ (mod \ 3) $
arXiv:1708.02152 [math.DS] (Published 2017-08-07)
Periodic $p$-adic Gibbs measures of $q$-states Potts model on Cayley tree: The chaos implies the vastness of $p$-adic Gibbs measures
arXiv:1609.09572 [math.DS] (Published 2016-09-30)
Reversibility Problem of Multidimensional Finite Cellular Automata