String attractors of some simple-Parry automatic sequences
Abstract
Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the community of combinatorics on words. In this context, they have been studied for several families of finite and infinite words. In this paper, we obtain string attractors of prefixes of particular infinite words generalizing k-bonacci words (including the famous Fibonacci word) and related to simple Parry numbers. In fact, our description involves the numeration systems classically derived from the considered morphisms. This extends our previous work published in the international conference WORDS 2023.
Cite
@article{arxiv.2302.13647,
title = {String attractors of some simple-Parry automatic sequences},
author = {France Gheeraert and Giuseppe Romana and Manon Stipulanti},
journal= {arXiv preprint arXiv:2302.13647},
year = {2024}
}
Comments
Extended version of a paper published in WORDS 2023. The conference version is arXiv:2302.13647v1