56 citations · 66 across the 7 of their papers we have counts for
9 papers
Birecurrent sets
Francesco Dolce, Dominique Perrin, Antonio Restivo +2
A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecur…
Specular sets
Valérie Berthé, Clelia De Felice, Vincent Delecroix +5
We introduce the notion of specular sets which are subsets of groups called here specular and which form a natural generalization of free groups. These sets are an abstract general…
Bifix codes and interval exchanges
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We investigate the relation between bifix codes and interval exchange transformations. We prove that the class of natural codings of regular interval echange transformations is clo…
Return words of linear involutions and fundamental groups
Valérie Berthé, Vincent Delecroix, Francesco Dolce +3
We investigate the natural codings of linear involutions. We deduce from the geometric representation of linear involutions as Poincaré maps of measured foliations a suitable defin…
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…