%0 Journal Article
%T Hard Asymptotic Sets for One-Dimensional Cellular Automata
%A Ville Salo
%J Computer Science
%D 2013
%I arXiv
%X We prove that the (language of the) asymptotic set (and the nonwandering set) of a one-dimensional cellular automaton can be $\SIGMA^1_1$-hard. We do not go into much detail, since the constructions are relatively standard.
%U http://arxiv.org/abs/1307.4910v1