Palindromes in Sturmian Words

Lecture Notes in Computer Science

Volumn 3572, Issue , 2005, Pages 199-208

  De Luca, Aldo ^a   De Luca, Alessandro ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; COMBINATORIAL MATHEMATICS; WORD PROCESSING;

COMBINATORIAL PROPERTIES; STURMIAN PALINDROMES; STURMIAN WORDS;

FORMAL LANGUAGES;

EID: 26444598495     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11505877_18     Document Type: Conference Paper

References (10)

1. Allouche, J.P., Shallit, J.: Chapters 9-10. In: Automatic Sequences. Cambridge University Press, Cambridge UK (2003)
2. Berstel, J., Séébold, P.: Sturmian words. In Lothaire, M., ed.: Algebraic Combinatorics on Words, Chapter 2. Cambridge University Press, Cambridge UK (2001)
3. Borel, J.P., Reutenauer, C.: Palindromic factors of billiard words. Theoretical Computer Science, to appear (2005)
4. Carpi, A.: Private communication (2005)
5. D'Alessandro, F.: A combinatorial problem on Trapezoidal words. Theoretical Computer Science 273 (2002) 11-33
6. de Luca, A.: On the combinatorics of finite words. Theoretical Computer Science 218 (1999) 13-39
7. de Luca, A.: Sturmian words: structure, combinatorics, and their arithmetics. Theoretical Computer Science 183 (1997) 45-82
8. de Luca, A., Mignosi, F.: Some combinatorial properties of Sturmian words. Theoretical Computer Science 136 (1994) 361-385
9. Droubay, X., Pirillo, G.: Palindromes and Sturmian words. Theoretical Computer Science 223 (1999) 73-85
10. Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading MA (1983)