SACAs: (Non-uniform) Cellular Automata that Converge to a Single Fixed Point
Supreeti Kamilya, Sumit Adak, Sukanta Das and Biplab K Sikdar
This work reports characterization and synthesis of a special class of 1-dimensional binary cellular automata (CAs) that always converge to a single fixed point from an arbitrary seed. These CAs are referred to as Single Attractor CAs (SACAs). To study the SACAs, a tool named reachability tree, is used. A concept called link is used to develop theories for SACAs. The algorithms for deciding and synthesizing SACAs have been reported in the paper.
Keywords: Single attractor cellular automata (SACAs), reachability tree, link, fixed point, convergence