Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration
From MaRDI portal
Publication:5227589
DOI10.1063/1.5089889zbMath1416.37015arXiv1703.09030WikidataQ91559800 ScholiaQ91559800MaRDI QIDQ5227589
Martin Cenek, Peter Banda, Christof Teuscher, John S. IV. Caughman
Publication date: 6 August 2019
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.09030
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-dimensional cellular automata
- Computation theoretic aspects of cellular automata
- Reversibility of 2D cellular automata is undecidable
- A novel image encryption algorithm using chaos and reversible cellular automata
- Algebraic properties of cellular automata
- Conservative logic
- The attractor-basin portrait of a cellular automaton
- Turbulent pattern bases for cellular automata
- Symmetry in self-correcting cellular automata
- Discrete DNA Reaction-Diffusion Model for Implementing Simple Cellular Automaton
- Cellular automaton model of crowd evacuation inspired by slime mould
- On DNA-Based Gellular Automata
- On the generation of high-quality random numbers by two-dimensional cellular automata
- Cellular Automata for Image Resizing
- The Role of Conceptual Structure in Designing Cellular Automata to Perform Collective Computation
- Cellular Automata and Groups
- Evolutionary Cellular Automata Based-Approach for Edge Detection
- Statistical mechanics of cellular automata
- A low-cost high-capacity associative memory design using cellular automata
- Two-dimensional cellular automata of radius one for density classification task
- Group Colorings and Bernoulli Subflows
- Counting toroidal binary arrays
- Periodic forests of stunted trees
- IV. Spirometric studies of Yemenite and Kurdish Jews in Israel
- The Garden-of-Eden Theorem for Finite Configurations
- Simple Computation-Universal Cellular Spaces
- Engineering Self-Organising Systems
- Encyclopedia of Complexity and Systems Science
- Cellular automata and finite groups
