1. Palindrome complexity;Allouche;Theoret. Comput. Sci.,2003
2. Palindromic complexity of infinite words associated with simple Parry numbers;Ambrož;Ann. Inst. Fourier,2007
3. L’. Balková, Z. Masáková, Palindromic complexity of infinite words associated with non-simple Parry numbers, Preprint DI, arXiv:math/0611508v1 (2006)
4. J. Bernat, Computation of L⊕ for several cubic Pisot numbers, Discrete Math. Theor. Comput. Sci. (2007) (in press)
5. Recent results on extensions of Sturmian words;Berstel;Internat. J. Algebra Comput.,2002