Reversibility of linear cellular automata on Cayley trees with periodic boundary condition
From MaRDI portal
Publication:1750742
DOI10.11650/tjm/8032zbMath1432.37023arXiv1603.01679OpenAlexW2963952420MaRDI QIDQ1750742
Publication date: 23 May 2018
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.01679
Undecidability and degrees of sets of sentences (03D35) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)
Related Items (1)
Cites Work
- Unnamed Item
- Sofic tree-shifts
- Cellular automata between sofic tree shifts
- Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
- Matrix algebraic formulae concerning some exceptional rules of two-dimensional cellular automata
- Reversibility of 2D cellular automata is undecidable
- On behavior of two-dimensional cellular automata with an exceptional rule
- Linear cellular automata over \(Z_ m\)
- Reversibility and surjectivity problems of cellular automata
- On the Bernoulli automorphism of reversible linear cellular automata
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Text compression using two-dimensional cellular automata
- Characterisation of a particular hybrid transformation of two-dimensional cellular automata
- Inverse rules of ECA with rule number 150
- Computation in reversible cellular automata
- The dynamics of expansive invertible onesided cellular automata
- The reversibility problem for a family of two-dimensional cellular automata
- Tree-shifts: Irreducibility, mixing, and the chaos of tree-shifts
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: Reversibility of linear cellular automata on Cayley trees with periodic boundary condition
