activity
20132021
most citedAcyclic, connected and tree sets

56 citations · 79 across the 13 of their papers we have counts for

collaborators
Showing cs.DMShow all

7 papers · 1 filter

cs.DM2019★ 3 cited

Some variations on Lyndon words

Francesco Dolce, Antonio Restivo, Christophe Reutenauer

In this paper we compare two finite words and by the lexicographical order of the infinite words and . Informally, we say that we compare and by the infi…

cs.DM2018

On generalized Lyndon words

Francesco Dolce, Antonio Restivo, Christophe Reutenauer

A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every…

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…

cs.DM2015

Enumeration formulæ in neutral sets

Francesco Dolce, Dominique Perrin

We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These f…

cs.DM2014

Regular Interval Exchange Transformations over a Quadratic Field

Francesco Dolce

We describe a generalization of a result of Boshernitzan and Carroll: an extension of Lagrange's Theorem on continued fraction expansion of quadratic irrationals to interval exchan…

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…

cs.DM2013

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…