activity
20152023
most citedRecognizability in S-adic shifts

3 citations · 4 across the 8 of their papers we have counts for

collaborators

8 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…

cs.DS2022

Fast detection of specific fragments against a set of sequences

Marie-Pierre Béal, Maxime Crochemore

We design alignment-free techniques for comparing a sequence or word, called a target, against a set of words, called a reference. A target-specific factor of a target against…

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.DS2021

Checking whether a word is Hamming-isometric in linear time

Marie-Pierre Béal, Maxime Crochemore

A finite word is Hamming-isometric if for any two word and of same length avoiding , can be transformed into by changing one by one all the letters on which…

math.DS2021

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.

cs.FL2015

-algebraicity of zeta functions of sofic-Dyck shifts

Marie-Pierre Béal, Cǎtǎlin Dima

We prove that the multivariate zeta function of a sofic-Dyck shift is the commutative series of some visibly pushdown language. As a consequence the zeta function of a sofic-Dyck s…