Skip to main content
SpringerLink
Log in

A Search Algorithm for Subshift Attractors of Cellular Automata

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kůrka, P.: On the measure attractor of a cellular automaton. Discrete Continuous Dyn. Syst. 2005, 524–535 (2005) Supplement volume

    MATH  Google Scholar 

  2. Formenti, E., Kůrka, P.: Subshift attractors of cellular automata. Nonlinearity 20, 105–117 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Culik, K., Pachl, J., Yu, S.: On the limit set of cellular automata. SIAM J. Comput. 18(4), 831–842 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Maass, A.: On the sofic limit set of cellular automata. Ergod. Theory Dyn. Syst. 15, 663–684 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21(3), 571–586 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Formenti, E., Kůrka, P.: A search algorithm for the maximal attractor of a cellular automaton. In: Thomas, W., Weil, P. (eds.) STACS 2007, vol. 4393, pp. 356–366. Springer, Berlin (2007)

    Chapter  Google Scholar 

  7. Boyle, M., Kitchens, B.: Periodic points for onto cellular automata. Indag. Math. 10(4), 483–493 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  9. Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  10. Kitchens, B.P.: Symbolic Dynamics. Springer, Berlin (1998)

    MATH  Google Scholar 

  11. Kari, J.: The Rice’s theorem for the limit sets of cellular automata. Theor. Comput. Sci. 127, 229–254 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Tarjan, R.: Depth-first search and linear search algorithms. SIAM J. Comput. 1, 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  13. Knuutila, T.: Re-describing an algorithm by Hopcroft. Theor. Comput. Sci. 250, 333–363 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117–1141 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ilie, L., Yu, S.: Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306, 373–390 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ilie, L., Solis-Oba, R., Yu, S.: Reducing NFAs by equivalences and preorders. In: Apostolico, A., Crochemore, M., Park, K. (eds.) Proceedings of the 16th CPM, Jeju Island, Korea, 2005. Lecture Notes in Computer Science, vol. 3537, pp. 310–321. Springer, Berlin (2005)

    Google Scholar 

  17. Ilie, L., Navarro, G., Yu, S.: On NFA reductions. In: Karhumaki, J. (ed.) Theory Is Forever (Salomaa Festschrift). Lecture Notes in Computer Science, vol. 3113, pp. 112–124. Springer, Berlin (2004)

    Google Scholar 

  18. Champarnaud, J.M., Coulon, F.: NFA reduction algorithms by means of regular inequalities. Theor. Comput. Sci. 327(3), 241–253 (2004)

    Article  MathSciNet  Google Scholar 

  19. Champarnaud, J.M., Coulon, F.: NFA reduction algorithms by means of regular inequalities—correction. Erratum in Theor. Comput. Sci. (2005)

Download references

Author information

Authors and Affiliations

  1. Laboratoire I3S, Université de Nice-Sophia Antipolis, 2000, route des Lucioles, Les Algorithmes, bât Euclide B, BP 121, 06903, Sophia Antipolis Cedex, France

    Enrico Formenti & Petr Kůrka

  2. Center for Theoretical Study, Academy of Sciences and Charles University in Prague, Jilská 1, 11000, Praha 1, Czech Republic

    Petr Kůrka

  3. Faculty of Mathematics and Physics, Charles University in Prague, Malostranské náměstí 25, 11800, Praha 1, Czech Republic

    Ondřej Zahradník

Authors
  1. Enrico Formenti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Kůrka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ondřej Zahradník
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Enrico Formenti.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Formenti, E., Kůrka, P. & Zahradník, O. A Search Algorithm for Subshift Attractors of Cellular Automata. Theory Comput Syst 46, 479–498 (2010). https://doi.org/10.1007/s00224-009-9230-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-009-9230-6

Keywords

Search

Navigation