Palindromes in sturmian words

Authors:
Aldo de Luca;Alessandro De Luca
Affiliations:
Dipartimento di Matematica e Applicazioni “R. Caccioppoli”, Università degli Studi di Napoli Federico II, Napoli, Italy;Dipartimento di Matematica e Applicazioni “R. Caccioppoli”, Università degli Studi di Napoli Federico II, Napoli, Italy
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 6
Cited 4

Some combinatorial properties of Sturmian words

Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics

Theoretical Computer Science - Special issue: formal language theory
On the combinatorics of finite words

Theoretical Computer Science
Palindromes and Sturmian words

Theoretical Computer Science
A combinatorial problem on Trapezoidal words

Theoretical Computer Science
Palindromic factors of billiard words

Theoretical Computer Science - The art of theory

Some characterizations of finite Sturmian words

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Searching for Gapped Palindromes

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Counting and verifying maximal palindromes

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Central sturmian words: recent developments

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

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.