Fiche du document
2015
- handle: 10670/1.lfc0nf
- Berthé, Valérie; De Felice, Clelia; Dolce, Francesco; Leroy, Julien; Perrin, Dominique; Reutenauer, Christophe et Rindone, Giuseppina (2015). « Maximal bifix decoding ». Discrete Mathematics, 338(5), pp. 725-742.
Ce document est lié à :
http://archipel.uqam.ca/8351/
Ce document est lié à :
http://dx.doi.org/10.1016/j.disc
Ce document est lié à :
doi:10.1016/j.disc.2014.12.010
Mots-clés
Combinatorics on words symbolic dynamicsSujets proches
Dynamics, Symbolic Esteem Deference Factors Agents, Manufacturers' Manufacturers' representatives Proof Factors CombinatoricsCiter ce document
Valérie Berthé et al., « Maximal bifix decoding », UQAM Archipel : articles scientifiques, ID : 10670/1.lfc0nf
Métriques
Partage / Export
Résumé
We consider 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 recurrent tree sets, where the tree sets are defined by a condition on the possible extensions of bispecial factors. We prove that this class is closed under maximal bifix decoding. The proof uses the fact that the class is also closed under decoding with respect to return words.