REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES
From MaRDI portal
Publication:2849227
DOI10.1142/S0218127413501010zbMath1272.37010WikidataQ58473529 ScholiaQ58473529MaRDI QIDQ2849227
Siap, Irfan, Hasan Akin, Selman Uguz
Publication date: 17 September 2013
Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)
matrix algebraperiodic boundaryternary fieldhexagonal cellular automatarule matrixreversible CA3-state cellular automata
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ Structure and Reversibility of 2D von Neumann Cellular Automata Over Triangular Lattice ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Unnamed Item ⋮ 2D Triangular von Neumann Cellular Automata with Periodic Boundary ⋮ The reversibility problem for a family of two-dimensional cellular automata ⋮ Self-Replicating Patterns in 2D Linear Cellular Automata ⋮ Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions ⋮ On the irreversibility of Moore cellular automata over the ternary field and image application ⋮ Real Linear Automata with a Continuum of Periodic Solutions for Every Period ⋮ The Transition Rules of 2D Linear Cellular Automata Over Ternary Field and Self-Replicating Patterns ⋮ Three-state von Neumann cellular automata and pattern generation
Cites Work
- Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
- Two-dimensional cellular automata
- Characterization of two-dimensional cellular automata over ternary fields
- Matrix algebraic formulae concerning some exceptional rules of two-dimensional cellular automata
- Synthesis of cryptographic interleaved sequences by means of linear cellular automata
- Reversibility of 2D cellular automata is undecidable
- Glider-based computing in reaction-diffusion hexagonal cellular automata
- Modelling forest fire spread using hexagonal cellular automata
- A multisecret sharing scheme for color images based on cellular automata
- Garden of Eden configurations for 2-D cellular automata with rule 2460 N
- On behavior of two-dimensional cellular automata with an exceptional rule
- Inversion of 2D cellular automata: Some complexity results
- VLSI architecture of a cellular automata machine
- Text compression using two-dimensional cellular automata
- On cellular automata over Galois rings
- Inverse rules of ECA with rule number 150
- Structure and reversibility of 2D hexagonal cellular automata
- Remark on cellular automata and shift preserving maps
- Multi-value cellular automaton models and metastable states in a congested phase
- ON THE STRUCTURE OF REAL-VALUED ONE-DIMENSIONAL CELLULAR AUTOMATA
- Statistical mechanics of cellular automata
- On reversibility of cellular automata with periodic boundary conditions
- Universality of Reversible Hexagonal Cellular Automata
- ON SPIRAL GLIDER-GUNS IN HEXAGONAL CELLULAR AUTOMATA: ACTIVATOR-INHIBITOR PARADIGM
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES
