Cellular Automata, Decidability and Phasespace
Klaus Sutner · Fundamenta Informaticae · 2010
Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phasespace of these automata, construed as automatic structures over infinite words.