Invertible behavior in elementary cellular automata with memory
From MaRDI portal
Publication:712682
DOI10.1016/J.INS.2012.02.063zbMATH Open1248.68345OpenAlexW2079917013MaRDI QIDQ712682FDOQ712682
Authors: Genaro J. Martínez, Norberto Hernández-Romero, Juan Carlos Seck-Tuoh-Mora, Ramon Alonso-Sanz
Publication date: 17 October 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.02.063
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universality in elementary cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Cellular automata. A discrete universe
- Title not available (Why is that?)
- Phenomenology of glider collisions in cellular automaton Rule 54 and associated logical gates
- Outer-totalistic cellular automata on graphs
- Cellular particle swarm optimization
- Fluctuation-driven computing on number-conserving cellular automata
- Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction
- On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Elementary cellular automata with elementary memory rules in cells: the case of linear rules
- Reversible cellular automata with memory: two-dimensional patterns from a single site seed
- Clustering in the one-dimensional three-color cyclic cellular automaton
- MODELING LINEAR DYNAMICAL SYSTEMS BY CONTINUOUS-VALUED CELLULAR AUTOMATA
- Elementary cellular automata with minimal memory and random number generation
- One-dimensional coupled cellular automata with memory: initial investigations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reversible structurally dynamic cellular automata with memory: a simple example
- Characterization of Reachable/Nonreachable Cellular Automata States
- Replication in one-dimensional cellular automata
Cited In (15)
- Designing complex dynamics in cellular automata with memory
- Asynchronous communicating cellular automata: formalization, robustness and equivalence
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Welch sets for random generation and representation of reversible one-dimensional cellular automata
- Structure and Reversibility of 2D von Neumann Cellular Automata Over Triangular Lattice
- Reversibility problem of multidimensional finite cellular automata
- Virtual cyclic cellular automata, finite group actions and recursive properties
- 2D Triangular von Neumann Cellular Automata with Periodic Boundary
- A comprehensive taxonomy of cellular automata
- Title not available (Why is that?)
- Emergence of density dynamics by surface interpolation in elementary cellular automata
- 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\)
- Chaotic properties of elementary cellular automata with majority memory
This page was built for publication: Invertible behavior in elementary cellular automata with memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712682)