{
  "id": "1211.7362",
  "version": "v2",
  "published": "2012-11-30T20:02:46.000Z",
  "updated": "2017-11-12T21:59:24.000Z",
  "title": "The entropy and reversibility of cellular automata on Cayley tree",
  "authors": [
    "Hasan Akin"
  ],
  "comment": "13 pages, 4 figures, the paper has been improved, and fixed some gramatical mistakes",
  "categories": [
    "math.DS",
    "math-ph",
    "math.MP"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-11-30T20:02:46.000Z",
      "title": "Cellular automata on Cayley tree",
      "abstract": "In this paper, we study cellular automata on Cayley tree of order 2 over the field $\\mathbb Z_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 automata for some given values of $a,b,c,d\\in \\mathbb{Z}_{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.",
      "comment": null,
      "journal": null,
      "doi": null
    },
    {
      "version": "v2",
      "updated": "2017-11-12T21:59:24.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "37A15",
      "37B40"
    ],
    "keywords": [
      "cayley tree",
      "study cellular automata",
      "prime numbers modulo",
      "finite cellular automata",
      "reversibility problem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1211.7362A"
    }
  }
}