Palindromic complexity of infinite words associated with non-simple   Parry numbers
  We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple Parry numbers $\beta$. 
L'ubom\'ira Balkov\'a, Zuzana Mas\'akov\'a