A Search Algorithm for Subshift Attractors of Cellular Automata
- First Online:
- Cite this article as:
- Formenti, E., Kůrka, P. & Zahradník, O. Theory Comput Syst (2010) 46: 479. doi:10.1007/s00224-009-9230-6
- 75 Downloads
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.