Random expansion method for the generation of complex cellular automata
From MaRDI portal
Publication:2666780
DOI10.1016/j.ins.2020.11.041zbMath1474.68201arXiv2009.09515OpenAlexW3107404100MaRDI QIDQ2666780
Irving Barragan-Vite, Genaro J. Martínez, Joselito Medina-Marín, Norberto Hernández-Romero, Juan Carlos Seck-Tuoh-Mora
Publication date: 23 November 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.09515
Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Measures of information, entropy (94A17)
Related Items
Cites Work
- Symbolic dynamics of glider guns for some one-dimensional cellular automata
- Stochastic automated search methods in cellular automata: The discovery of tens of thousands of glider guns
- Phenomenology of glider collisions in cellular automaton Rule 54 and associated logical gates
- Reachability problem in non-uniform cellular automata
- A symbiosis between cellular automata and genetic algorithms
- On the complexity of the stability problem of binary freezing totalistic cellular automata
- Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
- Generative complexity of Gray-Scott model
- Emergence of density dynamics by surface interpolation in elementary cellular automata
- Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Actin Automata with Memory
- On the Dynamics of Cellular Automata with Memory
- COMPLEX DYNAMICS OF ELEMENTARY CELLULAR AUTOMATA EMERGING FROM CHAOTIC RULES
- Game of Life Cellular Automata
- Phase Transitions of Cellular Automata
- A Trade-Off Between Simplicity and Robustness? Illustration on a Lattice-Gas Model of Swarming
- Complexity Steering in Cellular Automata
- On Patterns and Dynamics of Rule 22 Cellular Automaton
- Actin Automata: Phenomenology and Localizations
- Upper bound on the products of particle interactions in cellular automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Random expansion method for the generation of complex cellular automata