ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p

DOI10.1142/S0129183111017020zbMath1275.68098WikidataQ58473618 ScholiaQ58473618MaRDI QIDQ4914204

Ferhat Sah, Siap, Irfan, Hasan Akin

Publication date: 18 April 2013

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

zbMATH Keywords

cellular automatareversibilitymatrix representationsreflective boundary condition

Mathematics Subject Classification ID

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

Related Items (6)

Error correcting codes via reversible cellular automata over finite fields ⋮ The Entropy and Reversibility of Cellular Automata on Cayley Tree ⋮ Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ Unnamed Item ⋮ The reversibility problem for a family of two-dimensional cellular automata ⋮ Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions

Cites Work

• Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
• Reversible computing and cellular automata -- a survey
• Modelling forest fire spread using hexagonal cellular automata
• A multisecret sharing scheme for color images based on cellular automata
• On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
• Inversion of general tridiagonal matrices
• On cellular automata over Galois rings
• UPPER BOUND OF THE DIRECTIONAL ENTROPY OF A ℤ²-ACTION
• REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
• Statistical mechanics of cellular automata
• On reversibility of cellular automata with periodic boundary conditions
• ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA

This page was built for publication: ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p