Abstract
We present algorithms that permit increased efficiency in the calculation of conservation functions for cellular automata, and report results obtained from implementations of these algorithms to report conservation laws for 1-D cellular automata of higher order than any previously known. We introduce the notion of trivial and core conservation functions to distinguish truly new conservation functions from simple extensions of lower-order ones. We give new theorems related to these concepts, and show our use of them to derive more efficient algorithms for finding conservation functions. We then present the complete list of conservation functions up to order 16 for the 256 elementary 1-D binary cellular automata. These include CAs that were not previously known to have nontrivial conservation functions.
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.
