Palindromic complexity of infinite words associated with non-simple Parry numbers
Ľubomíra Dvořáková, Zuzana Masáková · RAIRO - Theoretical Informatics and Applications · 2008
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over a binary alphabet, φ(0) = 0a1, φ(1) = 0b1, with a - 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β.