Skip to main content
SpringerLink
Log in

Palindromes in Sturmian Words

  • Conference paper
Developments in Language Theory (DLT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3572))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allouche, J.P., Shallit, J.: Automatic Sequences, ch. 9-10. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  2. Berstel, J., Séébold, P.: Sturmian words. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, ch. 2. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  3. Borel, J.P., Reutenauer, C.: Palindromic factors of billiard words. Theoretical Computer Science (2005) (to appear)

    Google Scholar 

  4. Carpi, A.: Private communication (2005)

    Google Scholar 

  5. D’Alessandro, F.: A combinatorial problem on Trapezoidal words. Theoretical Computer Science 273, 11–33 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. de Luca, A.: On the combinatorics of finite words. Theoretical Computer Science 218, 13–39 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. de Luca, A.: Sturmian words: structure, combinatorics, and their arithmetics. Theoretical Computer Science 183, 45–82 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. de Luca, A., Mignosi, F.: Some combinatorial properties of Sturmian words. Theoretical Computer Science 136, 361–385 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Droubay, X., Pirillo, G.: Palindromes and Sturmian words. Theoretical Computer Science 223, 73–85 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Applicazioni “R. Caccioppoli”, Università degli Studi di Napoli Federico II, via Cintia, Monte S. Angelo, I-80126, Napoli, Italy

    Aldo de Luca & Alessandro De Luca

Authors
  1. Aldo de Luca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alessandro De Luca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Applicazioni, Università di Salerno, via Ponte Don Melillo, 84084, Fisciano, SA, Italy

    Clelia De Felice

  2. Dipartimento di Matematica ed Applicazioni, Università di Palermo, Via Archirafi, 34, 90123, Palermo, Italy

    Antonio Restivo

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Luca, A., De Luca, A. (2005). Palindromes in Sturmian Words. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_18

Download citation

  • DOI: https://doi.org/10.1007/11505877_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26546-7

  • Online ISBN: 978-3-540-31682-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation