Theory of Computing Systems

, Volume 46, Issue 3, pp 479–498

A Search Algorithm for Subshift Attractors of Cellular Automata


DOI: 10.1007/s00224-009-9230-6

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


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.


Sofic subshifts Subshift attractors Spreading sets Signal subshifts 

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Enrico Formenti
    • 1
  • Petr Kůrka
    • 1
    • 2
  • Ondřej Zahradník
    • 3
  1. 1.Laboratoire I3SUniversité de Nice-Sophia AntipolisSophia Antipolis CedexFrance
  2. 2.Center for Theoretical StudyAcademy of Sciences and Charles University in PraguePraha 1Czech Republic
  3. 3.Faculty of Mathematics and PhysicsCharles University in PraguePraha 1Czech Republic