A Search Algorithm for Subshift Attractors of Cellular Automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theory of Computing Systems Année : 2010

A Search Algorithm for Subshift Attractors of Cellular Automata

Résumé

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.

Dates et versions

hal-01242315 , version 1 (11-12-2015)

Identifiants

Citer

Enrico Formenti, Petr Kurka, Zahradník Ondřej. A Search Algorithm for Subshift Attractors of Cellular Automata. Theory of Computing Systems, 2010, 46 (3), pp.479-498. ⟨10.1007/s00224-009-9230-6⟩. ⟨hal-01242315⟩
56 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More