Combinatorial Properties of Sturmian Palindromes

We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an ex...

[1]  Giuseppe Pirillo,et al.  Episturmian words and some constructions of de Luca and Rauzy , 2001, Theor. Comput. Sci..

[2]  Giuseppe Pirillo,et al.  Palindromes and Sturmian Words , 1999, Theor. Comput. Sci..

[3]  Flavio D'Alessandro.  A combinatorial problem on Trapezoidal words , 2002, Theor. Comput. Sci..

[4]  Jeffrey Shallit,et al.  Automatic Sequences by Jean-Paul Allouche , 2003 .

[5]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[6]  Aldo de Luca,et al.  On the Combinatorics of Finite Words , 1999, Theor. Comput. Sci..

[7]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[8]  Aldo de Luca,et al.  Palindromes in Sturmian Words , 2005, Developments in Language Theory.

[9]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[10]  J. Shallit,et al.  Automatic Sequences: Contents , 2003 .

[11]  Christophe Reutenauer,et al.  Palindromic factors of billiard words , 2005, Theor. Comput. Sci..

[12]  Aldo de Luca,et al.  Codes of central Sturmian words , 2005, Theor. Comput. Sci..

[13]  Aldo de Luca,et al.  Sturmian Words: Structure, Combinatorics, and Their Arithmetics , 1997, Theor. Comput. Sci..

[14]  Filippo Mignosi,et al.  Some Combinatorial Properties of Sturmian Words , 1994, Theor. Comput. Sci..