Maximal bifix decoding - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Contributions to Discrete Mathematics Année : 2015

Maximal bifix decoding

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.
Fichier principal
Vignette du fichier
bifixDecodingArxivFinal.pdf (296.03 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01121880 , version 1 (02-03-2015)

Identifiants

Citer

Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, et al.. Maximal bifix decoding. Contributions to Discrete Mathematics, 2015, 338 (5), pp.725-742. ⟨10.1016/j.disc.2014.12.010⟩. ⟨hal-01121880⟩
111 Consultations
200 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More