On behavior of two-dimensional cellular automata with an exceptional rule

DOI10.1016/j.ins.2008.10.024zbMath1170.68025OpenAlexW2070832294MaRDI QIDQ1010139

Pei-Min Deng, Zhong Yi, Ying Zhai

Publication date: 3 April 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2008.10.024

zbMATH Keywords

cellular automataGarden of Edenmaximal cycle lengthmaximal transient length

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (12)

The Entropy and Reversibility of Cellular Automata on Cayley Tree ⋮ Structure and Reversibility of 2D von Neumann Cellular Automata Over Triangular Lattice ⋮ Structure and reversibility of 2D hexagonal cellular automata ⋮ Fluctuation-driven computing on number-conserving cellular automata ⋮ Characterization of two-dimensional cellular automata over ternary fields ⋮ 2D Triangular von Neumann Cellular Automata with Periodic Boundary ⋮ Reversibility of linear cellular automata on Cayley trees with periodic boundary condition ⋮ Garden of Eden configurations for 2-D cellular automata with rule 2460 N ⋮ On the irreversibility of Moore cellular automata over the ternary field and image application ⋮ The Transition Rules of 2D Linear Cellular Automata Over Ternary Field and Self-Replicating Patterns ⋮ REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES ⋮ Three-state von Neumann cellular automata and pattern generation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix algebraic formulae concerning some exceptional rules of two-dimensional cellular automata
• On the dynamics of cellular automata induced from a prefix code
• On randomization and discovery
• Some clarifications of the concept of a Garden-of-Eden configuration
• Predecessors of cellular automata states. III: Garden of Eden classification of cellular automata
• VLSI architecture of a cellular automata machine
• A characterization of important algorithms for quantum-dot cellular automata
• Regular biosequence pattern matching with cellular automata
• Text compression using two-dimensional cellular automata
• On cellular automata over Galois rings
• Computing with random quantum dot repulsion
• Transient and cyclic behavior of cellular automata with null boundary conditions
• Statistical mechanics of cellular automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• The Garden-of-Eden Theorem for Finite Configurations

This page was built for publication: On behavior of two-dimensional cellular automata with an exceptional rule