ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
From MaRDI portal
Publication:5481850
DOI10.1142/S0129183106009680zbMATH Open1102.68506MaRDI QIDQ5481850FDOQ5481850
Authors:
Publication date: 24 August 2006
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
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
- Reversibility and surjectivity problems of cellular automata
- Reversibility of linear cellular automata
- The structure of reversible one-dimensional cellular automata
Cites Work
- Title not available (Why is that?)
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Tesselations with local transformations
- Algebraic properties of cellular automata
- Reversibility of 2D cellular automata is undecidable
- Invertible cellular automata: A review
- Linear cellular automata with boundary conditions
Cited In (18)
- ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p
- 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
- Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions
- The inverse behavior of a reversible one-dimensional cellular automaton obtained by a single Welch diagram
- 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
- Basic schemes for reversible two-dimensional cellular automata
- Block invariance and reversibility of one dimensional linear cellular automata
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
- SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA
- 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\)
- On reversibility of cellular automata with periodic boundary conditions
- Ternary reversible number-conserving cellular automata are trivial
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)
