Abstract
This paper studies a special class of non-uniform cellular automata (CAs) that contain only single length cycle (point) attractors in their state space. These CAs always converge to some point attractors. A number of theorems and lemmas are reported in this paper to characterize this class of CAs. Reachability tree, a discrete tool for characterizing 1-d CA, has been utilized to develop theories for these types of CAs. We finally report an algorithm that synthesizes a non-uniform cellular automaton having only point attractors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.