ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA

DOI10.1142/S0129183106009680zbMath1102.68506MaRDI QIDQ5481850

No author found.

Publication date: 24 August 2006

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

zbMATH Keywords

reversibilitylinear algebra150 Wolfram cellular automatafinite Boolean cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items

Ternary reversible number-conserving cellular automata are trivial ⋮ SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA ⋮ Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ Virtual cyclic cellular automata, finite group actions and recursive properties ⋮ Block invariance and reversibility of one dimensional linear cellular automata ⋮ FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR ⋮ Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions ⋮ ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p ⋮ Reversibility of linear cellular automata ⋮ A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule ⋮ REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA

Cites Work

• Unnamed Item
• Reversibility of 2D cellular automata is undecidable
• Invertible cellular automata: A review
• Algebraic properties of cellular automata
• Linear cellular automata with boundary conditions
• Tesselations with local transformations
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures