Efficient enumeration of three-state two-dimensional number-conserving cellular automata
Authors:
- Adam DzedzejADAdam Dzedzej
- Barbara WolnikBWBarbara Wolnik
- Anna NencaANAnna Nenca
- Jan M. BaetensJBJan M. Baetens
- Bernard De BaetsBBBernard De Baets
- 1 October 2020
- journal article
- research article
- Published by Elsevier in Information and Computation
- Vol. 274
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than FourIEICE Transactions on Information and Systems, 2009
- Number conserving cellular automata II: dynamicsTheoretical Computer Science, 2003
- Number-conserving cellular automata I: decidabilityTheoretical Computer Science, 2003
- Euler-Lagrange Correspondence of Cellular Automaton for Traffic-Flow ModelsPhysical Review Letters, 2003
- Universality and decidability of number-conserving cellular automataTheoretical Computer Science, 2003
- Cellular automata approach to three-phase traffic theoryJournal of Physics A: General Physics, 2002
- Conservation laws in cellular automataNonlinearity, 2002
- Inversion of 2D cellular automata: some complexity resultsTheoretical Computer Science, 1994
- Lattice-Gas Automata for the Navier-Stokes EquationPhysical Review Letters, 1986
- Endomorphisms and automorphisms of the shift dynamical systemTheory of Computing Systems, 1969