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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01242315
Contributor : Enrico Formenti <>
Submitted on : Friday, December 11, 2015 - 6:30:33 PM
Last modification on : Monday, November 5, 2018 - 3:48:02 PM

Links full text

Identifiers

Collections

Citation

Enrico Formenti, Petr Kurka, Zahradník Ondřej. A Search Algorithm for Subshift Attractors of Cellular Automata. Theory of Computing Systems, Springer Verlag, 2010, 46 (3), pp.479-498. ⟨http://rd.springer.com/article/10.1007%2Fs00224-009-9230-6⟩. ⟨10.1007/s00224-009-9230-6⟩. ⟨hal-01242315⟩

Share

Metrics

Record views

91