2014 | OriginalPaper | Chapter
Synthesis of Non-uniform Cellular Automata Having only Point Attractors
Authors : Nazma Naskar, Sumit Adak, Pradipta Maji, Sukanta Das
Published in: Cellular Automata
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.