Non-uniform number-conserving elementary cellular automata
From MaRDI portal
Publication:6496149
DOI10.1016/J.INS.2023.01.033MaRDI QIDQ6496149
Maciej Dziemiańczuk, Bernard De Baets, Barbara Wolnik
Publication date: 2 May 2024
Published in: Information Sciences (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The cellular automaton interpretation of quantum mechanics
- Local rule distributions, language complexity and non-uniform cellular automata
- Realization problems for nonuniform cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- On conservative and monotone one-dimensional cellular automata and their particle representation
- Reachability problem in non-uniform cellular automata
- Non-uniform Cellular Automata
- Cellular automata approach to three-phase traffic theory
- Twenty Problems in the Theory of Cellular Automata
- Group Properties of Cellular Automata and VLSI Applications
- Construction of One-Dimensional Nonuniform Number Conserving Elementary Cellular Automata Rules
- Characterization of Reachable/Nonreachable Cellular Automata States
- A cellular automaton model for two-lane traffic.
This page was built for publication: Non-uniform number-conserving elementary cellular automata