On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
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 . It is a refinement of the classical notion of ω-limit sets dealing with the typical long term behavior of cellular automata. It focuses on the words whose probability of appearance does not tend to 0 as time tends to infinity (the persistent words). In this paper, we give a characterization of the persistent language for non sensitive cellular automata associated with Bernoulli measures. We also study the computational complexity of these languages. We show that the persistent language can be non-recursive. But our main result is that the set of quasi-nilpotent cellular automata (those with a single configuration in their μ-limit set) is neither recursively enumerable nor co-recursively enumerable.
KeywordsCellular Automaton Turing Machine Left Border Term Behavior Turing Degree
Unable to display preview. Download preview PDF.
- 4.Mazoyer, J., Rapaport, I.: Inducing an Order on Cellular Automata by a Grouping Operation. In: Symposium on Theoretical Aspects of Computer Science. LNCS (1998)Google Scholar
- 9.Sutner, K.: Cellular automata and intermediate degrees. Theoretical Computer Science 296 (2003)Google Scholar