Minimality and computability of languages of G-shifts

Djamel Eddine Amir, Benjamin Hellouin de Menibus

Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for $G$-shifts, where $G$ is a finitely generated…