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 de document :
Article dans une revue
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〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01242315
Contributeur : Enrico Formenti <>
Soumis le : vendredi 11 décembre 2015 - 18:30:33
Dernière modification le : samedi 12 décembre 2015 - 01:07:07

Identifiants

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〉

Partager

Métriques

Consultations de la notice

32