ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
From MaRDI portal
Publication:5481850
Recommendations
- The complexity of reversible cellular automata
- On the structure of the set of reversible cellular automata
- Unconventional Computation
- scientific article; zbMATH DE number 1189123
- Developments in Language Theory
- scientific article; zbMATH DE number 176951
- Reversibility and surjectivity problems of cellular automata
- Reversibility of linear cellular automata
- The structure of reversible one-dimensional cellular automata
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- Algebraic properties of cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Invertible cellular automata: A review
- Linear cellular automata with boundary conditions
- Reversibility of 2D cellular automata is undecidable
- Tesselations with local transformations
Cited in
(22)- On reversibility of cellular automata with periodic boundary conditions
- Ternary reversible number-conserving cellular automata are trivial
- FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR
- Reversibility of linear cellular automata
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Reversibility of CA-150 with symmetry local structure
- Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions
- Recurrent misconceptions in the study of CA reversibility on triangular grids
- The inverse behavior of a reversible one-dimensional cellular automaton obtained by a single Welch diagram
- Partial reversibility of one-dimensional cellular automata
- On 1D reversible cellular automata with reflective boundary over the prime field of order \(p\)
- On the invertible cellular automata 150 over \(\mathbb F_p\)
- Unconventional Computation
- Virtual cyclic cellular automata, finite group actions and recursive properties
- A NONLINEAR DYNAMICS PERSPECTIVE OF WOLFRAM'S NEW KIND OF SCIENCE PART VI: FROM TIME-REVERSIBLE ATTRACTORS TO THE ARROW OF TIME
- Block invariance and reversibility of one dimensional linear cellular automata
- Basic schemes for reversible two-dimensional cellular automata
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
- SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA
- scientific article; zbMATH DE number 6471459 (Why is no real title available?)
- 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: ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481850)
