Abstract

A classification of elementary cellular automata (CA) based on their pattern growth is introduced. It is shown that this classification is effective, that is, there exists an algorithm to determine to which class a given CA belongs. This algorithm is based on the properties of the local rule of CAs, not requiring the observation of their evolution. Furthermore, necessary and sufficient conditions to detect all the elementary CAs exhibiting a shift-like behavior are given; these CAs have interesting dynamical properties and chaotic characteristics.

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 call

Disclaimer: 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.