Laurent Boyer

Learn More
We study the notion of limit sets of cellular automata associated with probability measures (µ-limit sets). This notion was introduced by P. Kůrka and A. Maass in [1]. It is a refinement of the classical notion of ω-limit sets dealing with the typical long term behavior of cellular au-tomata. It focuses on the words whose probability of appearance does not(More)
This paper is about µ-limit sets of cellular automata, i.e. sets of congurations made of words which have a positive probability to appear arbitrarily late in the evolution, starting from an initial µ-random conguration. More precisely, we investigate the computational complexity of these sets and of decision problems concerning them. Our main results are:(More)
  • 1