activity
20212024
most citedString attractors of some simple-Parry automatic sequences

1 citations · 2 across the 6 of their papers we have counts for

collaborators

7 papers

cs.DM2024

Stability properties for subgroups generated by return words

France Gheeraert, Herman Goulet-Ouellet, Julien Leroy +1

Return words are a classical tool for studying shift spaces with low factor complexity. In recent years, their projection inside groups have attracted some attention, for instance…

cs.DM2024★ 1 cited

Algebraic characterization of dendricity

France Gheeraert, Herman Goulet-Ouellet, Julien Leroy +1

Dendric shift spaces simultaneously generalize codings of regular interval exchanges and episturmian shift spaces, themselves both generalizations of Sturmian words. One of the key…

math.CO2024

String attractors and bi-infinite words

Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus

String attractors are a combinatorial tool coming from the field of data compression. It is a set of positions within a word which captures an occurrence of every factor. While one…

math.CO2023★ 1 cited

String attractors of some simple-Parry automatic sequences

France Gheeraert, Giuseppe Romana, Manon Stipulanti

Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the commu…

cs.DM2022

Some properties of morphic images of (eventually) dendric words

France Gheeraert

The class of (eventually) dendric words generalizes well-known families such as the Arnoux-Rauzy words or the codings of interval exchanges. There are still many open questions abo…

math.DS2022

-adic characterization of minimal dendric shifts

France Gheeraert, Julien Leroy

Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian s…