Fiche du document
2015
- handle: 10670/1.btf2wk
- Berthé, Valérie; De Felice, Clelia; Dolce, Francesco; Leroy, Julien; Perrin, Dominique; Reutenauer, Christophe et Rindone, Giuseppina (2015). « The finite index basis property ». Journal of Pure and Applied Algebra, 219(7), pp. 2521-2537.
Ce document est lié à :
http://archipel.uqam.ca/8350/
Ce document est lié à :
http://dx.doi.org/10.1016/j.jpaa
Ce document est lié à :
doi:10.1016/j.jpaa.2014.09.014
Mots-clés
bifix codes Sturmian setsSujets proches
Codes ContractionsCiter ce document
Valérie Berthé et al., « The finite index basis property », UQAM Archipel : articles scientifiques, ID : 10670/1.btf2wk
Métriques
Partage / Export
Résumé
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 symbolic systems corresponding to Sturmian words. We introduce a class of sets of factors of an infinite word with linear factor complexity containing Sturmian sets and regular interval exchange sets, namely the class of tree sets. We prove as a main result that for a uniformly recurrent tree set S, a finite bifix code X on the alphabet A is S-maximal of S-degree d if and only if it is the basis of a subgroup of index d of the free group on A.