activity
20052023
most citedAcyclic, connected and tree sets

56 citations · 88 across the 23 of their papers we have counts for

collaborators

30 papers

cs.FL2023★ 3 cited

Recognizability in S-adic shifts

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo +1

We investigate questions related to the notion of recognizability of sequences of morphisms, a generalization of Moss{é}'s Theorem. We consider the most general class of morphisms…

math.CO2022

The palindromization map

Dominique Perrin, Christophe Reutenauer

The palindromization map has been defined initially by Aldo de Luca in the context of Sturmian words. It was extended to the free group of rank by Kassel and the second autho W…

math.DS2022★ 1 cited

A note on one-sided recognizable morphisms

Marie-Pierre Béal, Valérie Berthé, Dominique Perrin +1

We revisit the notion of one-sided recognizability of morphisms and its relation to two-sided recognizability.

math.DS2021

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…

math.DS2021

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…

cs.FL2021

The degree of a finite set of words

Dominique Perrin, Andrew Ryzhikov

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\…