Abstract
We present a simple approach for finding all number-conserving two-dimensional cellular automata with the von Neumann neighborhood. We demonstrate the efficiency of this approach by enumerating and describing four special cases: totalistic, outer-totalistic, binary and three-state cellular automata. The last result was not published before. We then proceed to find all reversible two-dimensional number-conserving cellular automata with three states with the von Neumann neighborhood and show there are only trivial ones.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
