Skip to Main content Skip to Navigation
Journal articles

Maximal bifix decoding

Valérie Berthé 1 Clelia de Felice 2 Francesco Dolce 3 Julien Leroy 4 Dominique Perrin 3 Christophe Reutenauer 5 Giuseppina Rindone 3
1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 DIA - Dipartimento Informatica ed Applicazioni "Renato M. Capocelli"
3 ligm - Laboratoire d'Informatique Gaspard-Monge
4 Uni.lu - Université du Luxembourg
5 LaCIM - Laboratoire de combinatoire et d'informatique mathématique [Montréal]
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download
https://hal-upec-upem.archives-ouvertes.fr/hal-01121880
Contributor : Admin Ligm <>
Submitted on : Monday, March 2, 2015 - 4:59:28 PM
Last modification on : Tuesday, December 8, 2020 - 10:28:50 AM
Long-term archiving on: : Sunday, May 31, 2015 - 11:20:25 AM

File

Vignette du document
bifixDecodingArxivFinal.pdf
Files produced by the author(s)

Identifiers

Collections

UPEC-UPEM | UNIV-PARIS7 | CNRS | LIGM_MOA | LIGM | ENPC | PARISTECH | USPC | ESIEE-PARIS | UNIV-PARIS

Citation

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

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

389

Files downloads

539