A decomposition theorem for number-conserving multi-state cellular automata on triangular grids
From MaRDI portal
Publication:2693635
DOI10.1016/j.tcs.2023.113795OpenAlexW4322724341WikidataQ122625090 ScholiaQ122625090MaRDI QIDQ2693635
Anna Nenca, Barbara Wolnik, Bernard De Baets
Publication date: 24 March 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113795
Cites Work
- Unstructured triangular cellular automata for modeling geographic spread
- Bulking I: An abstract theory of bulking
- Communication complexity in number-conserving and monotone cellular automata
- Additive conserved quantities in discrete-time lattice dynamical systems
- Universality and decidability of number-conserving cellular automata
- Number-conserving cellular automata I: Decidability.
- On conservative and monotone one-dimensional cellular automata and their particle representation
- A split-and-perturb decomposition of number-conserving cellular automata
- Cellular automaton for migration in ecosystem: application of traffic model to a predator-prey system
- Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules
- Symmetric cellular automata
- Cellular automaton rules conserving the number of active sites
- Number-conserving cellular automata with a von Neumann neighborhood of range one
- Conservation laws in cellular automata
- 5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A decomposition theorem for number-conserving multi-state cellular automata on triangular grids
