A search algorithm for the maximal attractor of a cellular automaton

  • Authors:

  • Enrico Formenti;Petr Kůrka

  • Affiliations:

  • Laboratoire I3S, Université de Nice Sophia Antipolis, Sophia Antipolis - Cedex, France;Laboratoire I3S, Université de Nice Sophia Antipolis, Sophia Antipolis - Cedex, France and Center for Theoretical Study, Charles University in Prague, Praha 1, Czechia

  • Venue:
  • STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an algorithm that finds the maximal attractor (limit set) of those cellular automata whose maximal attractor is a sofic subshift.