2014 | OriginalPaper | Buchkapitel
Synthesis of Non-uniform Cellular Automata Having only Point Attractors
verfasst von : Nazma Naskar, Sumit Adak, Pradipta Maji, Sukanta Das
Erschienen in: Cellular Automata
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.