$\mu$-Limit Sets of Cellular Automata from a Computational Complexity Perspective

Laurent Boyer, Martin Delacourt, Victor Poupet +2

This paper concerns $\mu$-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial $\mu$-ra…