  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.
