1. Sums of digits, overlaps, and palindromes;Allouche;Discrete Math. Theor. Comput. Sci.,2000
2. Factor versus palindromic complexity of uniformly recurrent infinite words;Baláži;Theoret. Comput. Sci.,2007
3. Palindromic complexity of codings of rotations;Blondin Massé;Theoret. Comput. Sci.,2011
4. On the critical exponent of generalized Thue–Morse words;Blondin Massé;Discrete Math. Theor. Comput. Sci.,2007
5. On generalized pseudostandard words over binary alphabets;Blondin-Massé;J. Integer Seq.,2013