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.

翻译：字符串吸引子最初由Kempa和Prezza于2018年作为文本压缩算法的粘合剂提出，此后已成为词组合学领域引人注目的理论研究对象。在此框架下，学者们已针对若干有限词与无限词族展开研究。本文获得了特定无限词前缀的字符串吸引子——这些无限词推广了k-波那契词（包括著名的斐波那契词），并与简单Parry数相关。事实上，我们的描述涉及由所考虑的态射经典导出的记数系统。这拓展了我们此前发表在WORDS 2023国际会议上的研究成果。