Pages that link to "Item:Q5481850"
From MaRDI portal
The following pages link to ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA (Q5481850):
Displaying 18 items.
- Reversibility of linear cellular automata (Q545985) (← links)
- Algebraic property of flow diagram in a time-reverse cellular automaton (Q1332367) (← links)
- The set of reversible \(90/150\) cellular automata is regular (Q1392576) (← links)
- Block invariance and reversibility of one dimensional linear cellular automata (Q1738319) (← links)
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions (Q1750043) (← links)
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule (Q2009571) (← links)
- On the invertible cellular automata 150 over \(\mathbb F_p\) (Q2434846) (← links)
- Ternary reversible number-conserving cellular automata are trivial (Q2660739) (← links)
- A NONLINEAR DYNAMICS PERSPECTIVE OF WOLFRAM'S NEW KIND OF SCIENCE PART VI: FROM TIME-REVERSIBLE ATTRACTORS TO THE ARROW OF TIME (Q3498645) (← links)
- SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA (Q3500226) (← links)
- FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR (Q3560152) (← links)
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA (Q3638736) (← links)
- ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p (Q4914204) (← links)
- (Q5500607) (← links)
- Recurrent Misconceptions in the Study of CA Reversibility on Triangular Grids (Q5854862) (← links)
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641) (← links)
- Virtual cyclic cellular automata, finite group actions and recursive properties (Q6195446) (← links)
- Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions (Q6593674) (← links)
