A Search Algorithm for Subshift Attractors of Cellular Automata

Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors (which are omega-limits of spreading sets found) as forward images of joins of signal subshifts.

• Type: Journal
• Year: 2010
• Where: MST
• Authors: Enrico Formenti, Petr Kurka, Ondrej Zahradník
• Keywords: Cellular Automaton, Corresponding Subshift Attractors, Heuristic Algorithm, MST 2010