 |
HAL UPEC - UPEM Portal |  |
 |
Journal articles
Maximal bifix decoding
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.
Cited literature [34 references]
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, June 2, 2020 - 7:08:03 PM
Document(s) archivé(s) le : Sunday, May 31, 2015 - 11:20:25 AM
Contributor : Admin Ligm <>
Submitted on : Monday, March 2, 2015 - 4:59:28 PM
Last modification on : Tuesday, June 2, 2020 - 7:08:03 PM
Document(s) archivé(s) le : Sunday, May 31, 2015 - 11:20:25 AM
File
bifixDecodingArxivFinal.pdf
Files produced by the author(s)
