A Characterization of Subshifts with Computable Language
Emmanuel Jeandel, Pascal Vanier · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2019
Subshifts are sets of colorings of Z^d by a finite alphabet that avoid some family of forbidden patterns. We investigate here some analogies with group theory that were first noticed by the first author. In particular we prove several theorems on subshifts inspired by Higman’s embedding theorems of group theory, among which, the fact that subshifts with a computable language can be obtained as restrictions of minimal subshifts of finite type.