Palindromic complexity of infinite words associated with non-simple Parry numbers

Abstract

We study the palindromic complexity of infinite words $u_{\beta }$, the fixed points of the substitution over a binary alphabet, $\varphi (0)=0^{a}1$, $\varphi (1)=0^{b}1$, with $a-1\ge b\ge 1$, which are canonically associated with quadratic non-simple Parry numbers $\beta$.

16 pages