Abstract
This paper presents the concept of multi-class classmer using non-uniform cellular Automata under periodic boundary condition. To design this multi-classifier, a special class of non-uniform cellular automata (CA) that contain point attractors in their state space, is studied. These CA always converge to some point attractors. The reachability tree, a discrete tool for characterizing l-d CA and Link, have been utilized to develop theories for these types of CA. We report an algorithm that synthesizes a non-uniform cellular automaton having only point attracto/rs.
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.
