Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
From MaRDI portal
Publication:6118641
DOI10.1016/j.ins.2022.01.045OpenAlexW4211107284MaRDI QIDQ6118641
No author found.
Publication date: 28 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2022.01.045
Cites Work
- Unnamed Item
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Local rule distributions, language complexity and non-uniform cellular automata
- Three research directions in non-uniform cellular automata
- Reversibility of linear cellular automata
- Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
- Invertible behavior in elementary cellular automata with memory
- Non-uniform cellular automata: classes, dynamics, and decidability
- Reversibility of 2D cellular automata is undecidable
- Conservation of some dynamical properties for operations on cellular automata
- A novel image encryption algorithm using chaos and reversible cellular automata
- A multisecret sharing scheme for color images based on cellular automata
- Garden of Eden configurations for 2-D cellular automata with rule 2460 N
- On the directional dynamics of additive cellular automata
- Linear cellular automata over \(Z_ m\)
- The set of reversible \(90/150\) cellular automata is regular
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Reversibility of linear cellular automata on Cayley trees with periodic boundary condition
- Theory of cellular automata: a survey
- Solution of some conjectures about topological properties of linear cellular automata
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- \(\sigma\)-Automata and Chebyshev-polynomials
- Dynamical behavior of additive cellular automata over finite abelian groups
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- An efficiently computable characterization of stability and instability for linear cellular automata
- Welch sets for random generation and representation of reversible one-dimensional cellular automata
- Inverse rules of ECA with rule number 150
- Reversibility problem of multidimensional finite cellular automata
- Structure and reversibility of 2D hexagonal cellular automata
- On the invertible cellular automata 150 over \(\mathbb F_p\)
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
- A New Algorithm for Factoring Polynomials Over Finite Fields
- On reversibility of cellular automata with periodic boundary conditions
- ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p
- Graphs Related to Reversibility and Complexity in Cellular Automata
- Algebraic Coding Theory
- ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
- Factoring polynomials over finite fields: A survey
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
This page was built for publication: Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
