Palindromic complexity of infinite words associated with non-simple Parry numbers
We study the palindromic complexity of infinite words $u_β$, the fixed points of the substitution over a binary alphabet, $ϕ(0)=0^a1$, $ϕ(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple Parry numbers $β$.
math.CO↗