Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
From MaRDI portal
Publication:1750043
DOI10.1016/j.ins.2015.06.048zbMath1390.68451OpenAlexW838824395MaRDI QIDQ1750043
Bin Yang, Aiyun Xiang, Chao Wang
Publication date: 17 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.06.048
Related Items
Ternary reversible number-conserving cellular automata are trivial, Reversibility problem of multidimensional finite cellular automata, The Entropy and Reversibility of Cellular Automata on Cayley Tree, Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\), Reversibility of linear cellular automata on Cayley trees with periodic boundary condition, Welch sets for random generation and representation of reversible one-dimensional cellular automata, Reversibility of non-saturated linear cellular automata on finite triangular grids, A split-and-perturb decomposition of number-conserving cellular automata, Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets, Characterization of reversible intermediate boundary cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversibility of linear cellular automata
- Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
- Characterization of two-dimensional cellular automata over ternary fields
- A cryptosystem based on elementary cellular automata
- Invertible behavior in elementary cellular automata with memory
- Reversibility of 2D cellular automata is undecidable
- Reversible computing and cellular automata -- a survey
- Garden of Eden configurations for 2-D cellular automata with rule 2460 N
- Algebraic properties of cellular automata
- Linear cellular automata over \(Z_ m\)
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- The set of reversible \(90/150\) cellular automata is regular
- Theory of cellular automata: a survey
- Elliptic curves over finite fields and reversibility of additive cellular automata on square grids
- \(\sigma\)-Automata and Chebyshev-polynomials
- Inverse rules of ECA with rule number 150
- Structure and reversibility of 2D hexagonal cellular automata
- On the invertible cellular automata 150 over \(\mathbb F_p\)
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
- Statistical mechanics of cellular automata
- Twenty Problems in the Theory of Cellular Automata
- On reversibility of cellular automata with periodic boundary conditions
- ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p
- Resolution Scalable Image Coding With Reversible Cellular Automata
- ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
