Hard Asymptotic Sets for One-Dimensional Cellular Automata
Computational Complexity
2013-07-19 v1 Formal Languages and Automata Theory
Dynamical Systems
Abstract
We prove that the (language of the) asymptotic set (and the nonwandering set) of a one-dimensional cellular automaton can be -hard. We do not go into much detail, since the constructions are relatively standard.
Keywords
Cite
@article{arxiv.1307.4910,
title = {Hard Asymptotic Sets for One-Dimensional Cellular Automata},
author = {Ville Salo},
journal= {arXiv preprint arXiv:1307.4910},
year = {2013}
}