56 citations · 79 across the 13 of their papers we have counts for
5 papers · 1 filter
Notes on sets of first return
Valérie Berthé, Clelia De Felice, Francesco Dolce +3
We prove in this note that, for an alphabet with three letters, the set of first return to a given word in a set satisfying the tree condition is a basis of the free group.
Maximal bifix decoding
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We introduce a class of sets of words which is a natural common generalization of Sturmian sets and of interval exchange sets. This class of sets consists of the uniformly recurren…
Acyclic, connected and tree sets
Valerie Berthé, Clelia De Felice, Francesco Dolce +4
Given a set of words, one associates to each word in an undirected graph, called its extension graph, and which describes the possible extensions of on the left and…
The finite index basis property
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbo…
Interval exchanges, admissibility and branching Rauzy induction
Francesco Dolce, Dominique Perrin
We introduce a definition of admissibility for subintervals in interval exchange transformations. Using this notion, we prove a property of the natural codings of interval exchange…