56 citations · 88 across the 23 of their papers we have counts for
3 papers · 2 filters
Decidable problems in substitution shifts
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability o…
Recognizability of morphisms
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Mossé's theorem and actually of a generalization to non primitive…
Unambiguously coded shifts
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
We study the coded systems introduced by Blanchard and Hansel. We give several constructions which allow one to represent a coded system as a strongly unambiguous one.