L'ubom{\'ı}ra Balková, Zuzana Masáková
Published 2006-11-16Version 1
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$.
On a class of infinite words with affine factor complexity
Palindromic complexity of infinite words associated with simple Parry numbers
Some further results on squarefree arithmetic progressions in infinite words
![QR code for arXiv:math/0611508 [math.CO]](http://oss.arxitics.com/images/favicon.svg)