Maximal bifix decoding
Combinatorics
2015-02-25 v4
Abstract
We introduce 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.
Cite
@article{arxiv.1308.5396,
title = {Maximal bifix decoding},
author = {Valérie Berthé and Clelia De Felice and Francesco Dolce and and Julien Leroy and Dominique Perrin and Christophe Reutenauer and Giuseppina Rindone},
journal= {arXiv preprint arXiv:1308.5396},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1305.0127