activity
20102017
most citedAcyclic, connected and tree sets

56 citations · 66 across the 7 of their papers we have counts for

collaborators

9 papers

cs.FL2017

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…

cs.DM2015

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…

math.CO2014

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…

math.CO2014★ 9 cited

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…

math.CO2013

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.

math.CO2013★ 1 cited

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…

math.CO2013★ 56 cited

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…

cs.DM2013

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…

math.CO2010

Bifix codes and Sturmian words

Jean Berstel, Clelia De Felice, Dominique Perrin +2

We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most…