Abstract
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 exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
APA
De Luca, A., & De Luca, A. (2005). Palindromes in Sturmian Words. In Lecture Notes in Computer Science (Vol. 3572, pp. 199–208). Springer Verlag. https://doi.org/10.1007/11505877_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free