Palindromic complexity of infinite words associated with non-simple Parry numbers
Doppler Institute for Mathematical Physics and Applied
Mathematics & Department of Mathematics, FNSPE, Czech Technical
University, Trojanova 13, 120 00 Praha 2, Czech Republic;
Accepted: 30 January 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 β.
Mathematics Subject Classification: 68R15 / 11A63
Key words: Palindromes / beta-expansions / infinite words.
© EDP Sciences, 2008