REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA

DOI10.1142/S0129183109014217zbMath1175.37020OpenAlexW2018208878MaRDI QIDQ3638736

No author found.

Publication date: 28 October 2009

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

Full work available at URL: https://doi.org/10.1142/s0129183109014217

zbMATH Keywords

cellular automatareversibilitymatrix theorysymmetric neighborhoods

Mathematics Subject Classification ID

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

Related Items

Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ 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

Cites Work

• Invertible cellular automata: A review
• Tesselations with local transformations
• ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
• Unnamed Item