moteur de recherche

Séminaire Algo - Francesco Dolce
Séminaire Algo - Francesco Dolce
2-Apr-2019 14:00
Age: 1 year

Francesco Dolce

Eventually dendric sets

Seminar room 4B125 (Copernic building)

Abstract: A factorial set of words is called eventually dendric if the possible extensions of all long enough words are described by a graph which is a tree. This new class of languages contains a number of classes of interest, like Sturmian sets and Interval Exchange sets. We show that eventually dendric sets are closed under two natural transformations. The first one is called conjugacy and is obtained by sliding block coding. The second one is called the complete bifix decoding, and typically includes codings by non overlapping blocks of fixed length. This is a joint work with Dominique Perrin.

<- Back to: Accueil