Description of reversibility of 9-cyclic 1D finite linear cellular automata with periodic boundary conditions
From MaRDI portal
Publication:6137468
Authors: Hasan Akin
Publication date: 4 September 2023
Full work available at URL: https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-16-number-1-2-2021/jca-16-1-2-p-127-151/
Recommendations
- Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
- The reversibility of \((2r + 1)\)-cyclic rule cellular automata
- On 1D reversible cellular automata with reflective boundary over the prime field of order \(p\)
- On reversibility of cellular automata with periodic boundary conditions
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
Cites Work
- Title not available (Why is that?)
- Reversible computing and cellular automata -- a survey
- Procedures for calculating reversible one-dimensional cellular automata
- Inverse rules of ECA with rule number 150
- Matrix methods and local properties of reversible one-dimensional cellular automata
- On reversibility of cellular automata with periodic boundary conditions
- The inverse behavior of a reversible one-dimensional cellular automaton obtained by a single Welch diagram
- Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
- On 1D reversible cellular automata with reflective boundary over the prime field of order \(p\)
- Reversibility algorithms for 3-state hexagonal cellular automata with periodic boundaries
- The reversibility of \((2r + 1)\)-cyclic rule cellular automata
- 2-D reversible cellular automata with nearest and prolonged next nearest neighborhoods under periodic boundary
- Self-replicating patterns in 2D linear cellular automata
Cited In (4)
- Characterization of 1-d periodic boundary reversible CA
- Virtual cyclic cellular automata, finite group actions and recursive properties
- Title not available (Why is that?)
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
This page was built for publication: Description of reversibility of 9-cyclic 1D finite linear cellular automata with periodic boundary conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137468)