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.
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 : Friday, January 4, 2019 - 5:32:57 PM
Long-term archiving on : Sunday, May 31, 2015 - 11:20:25 AM
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⟩
