Abstract
Cellular automata (CA) is not only a discrete dynamical system with infinite dimension, but also an important computational model. One of the most important problems in the theory of CA is how to establish the relationship between the local rules and the global behavior and then obtain the classification of CA. In this paper, we consider previous works on the classification of CA, including dynamical, statistical and computational classification and address the significance of research on theory of CA and complexity.
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.
