Garden of Eden configurations for 2-D cellular automata with rule 2460 N
From MaRDI portal
Publication:991896
DOI10.1016/J.INS.2010.05.039zbMATH Open1206.68205OpenAlexW2149896053WikidataQ58473741 ScholiaQ58473741MaRDI QIDQ991896FDOQ991896
Authors: Hasan Akin, Irfan Siap, Ferhat Sah 
Publication date: 8 September 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.05.039
Recommendations
- Garden of Eden configurations of a particular hybrid transformation of two-dimensional cellular automata
- 2-D reversible cellular automata with nearest and prolonged next nearest neighborhoods under periodic boundary
- The Garden of Eden theorem for cellular automata on group sets
- scientific article; zbMATH DE number 4043248
- Characterization of two-dimensional cellular automata over ternary fields
Data encryption (aspects in computer science) (68P25) Cellular automata (computational aspects) (68Q80)
Cites Work
- Endomorphisms and automorphisms of the shift dynamical system
- Cryptography. Theory and practice
- Statistical mechanics of cellular automata
- Title not available (Why is that?)
- On the dynamics of cellular automata induced from a prefix code
- Reversibility of 2D cellular automata is undecidable
- On behavior of two-dimensional cellular automata with an exceptional rule
- A multisecret sharing scheme for color images based on cellular automata
- Title not available (Why is that?)
- On cellular automata over Galois rings
- Title not available (Why is that?)
- VLSI architecture of a cellular automata machine
- Text compression using two-dimensional cellular automata
- Characterisation of a particular hybrid transformation of two-dimensional cellular automata
- On the directional entropy of \(\mathbb Z^2\)-actions generated by additive cellular automata
- Characterization of two-dimensional cellular automata over ternary fields
- Matrix algebraic formulae concerning some exceptional rules of two-dimensional cellular automata
- Inversion of 2D cellular automata: Some complexity results
- Garden of Eden states in traffic models
- Some clarifications of the concept of a Garden-of-Eden configuration
- The Garden-of-Eden Theorem for Finite Configurations
- Multi-value cellular automaton models and metastable states in a congested phase
- Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Symmetry in Gardens of Eden
- Constrained Eden
- On the irreversibility of Moore cellular automata over the ternary field and image application
- Garden of Eden configurations of a particular hybrid transformation of two-dimensional cellular automata
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Three-state von Neumann cellular automata and pattern generation
- The entropy and reversibility of cellular automata on Cayley tree
- Reversibility algorithms for 3-state hexagonal cellular automata with periodic boundaries
- Structure and reversibility of 2D hexagonal cellular automata
- Self-replicating patterns in 2D linear cellular automata
- Title not available (Why is that?)
- The Transition Rules of 2D Linear Cellular Automata Over Ternary Field and Self-Replicating Patterns
- Emergence of universal global behavior from reversible local transitions in asynchronous systems
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
- Abduction, unpredictability and Garden of Eden
This page was built for publication: Garden of Eden configurations for 2-D cellular automata with rule 2460 N
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991896)
