On the dynamics and recursive properties of multidimensional symbolic systems (Q1016235)

The paper starts with several definitions such as shift of finite type and sofic shift, in the set theoretical setting. Their dynamics is studied in connection with the dynamics of cellular automata. The cellular automaton is viewed as a continuous transformation \(f:\Sigma^{\mathbb{Z}^d}\mapsto\Sigma^{\mathbb{Z}^d}\) of the full shift which commutes with the shift action. The framework thus defined serves to solve such problems as entropy of the cellular automata, topological dynamics aspects, representation of Turing machines within shifts of finite type, real Turing machines a.o.