Skip to main content

Recurrence Function on Sturmian Words: A Probabilistic Study

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2015 (MFCS 2015)

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

  • 690 Accesses

Abstract

This paper is a first attempt to describe the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which provides precise information on the structure of such a word. With each Sturmian word of slope \(\alpha \), we associate particular sequences of factor lengths which have a given “position” with respect to the sequence of continuants of \(\alpha \), we then let \(\alpha \) to be uniformly drawn inside the unit interval [0,1]. This probabilistic model is well-adapted to better understand the role of the position in the recurrence properties.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Adamczewski, B., Allouche, J.-P.: Reversals and palindromes in continued fractions, heoret. Comput. Sci. 380, 220–237 (2007)

    MathSciNet  MATH  Google Scholar 

  2. Bourdon, J., Daireaux, B., Vallée, B.: Dynamical analysis of \(\alpha \)-Euclidean algorithms. J. Algorithms 44, 246–285 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cassaigne, J.: Limit values of the recurrent quotient of Sturmian sequences. Theoret. Comput. Sci. 218, 3–12 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cesaratto, E., Vallée, B.: Pseudo-randomness of a random Kronecker sequence. An instance of dynamical analysis, Chapter 11. In: Berthé, V., Rigo, M. (eds.) Combinatorics, Words and Symbolic Dynamics in the book Combinatorics, Words and Symbolic Dynamics, pp. 405–448. Cambridge University Press (To appear)

    Google Scholar 

  5. Flajolet, P., Vallée, B.: Continued fraction algorithms, functional operators, and structure constants. Theoret. Comput. Sci. 94, 1–34 (1998)

    Article  Google Scholar 

  6. Losifescu, M., Kraaikamp, C.: Metrical Theory of Continued Fractions, Collection Mathematics and Its Applications. Kluwer Academic Press, Dordrecht (2002)

    Book  Google Scholar 

  7. Lévy, P.: Sur le développement en fraction continue d’un nombre choisi au hasard. Compos. Math. 3, 286–303 (1936)

    Google Scholar 

  8. Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  9. Morse, M., Hedlund, G.: Symbolics dynamics II. Sturmian trajectories. Am. J. Math. 62, 1–42 (1940)

    Article  MathSciNet  MATH  Google Scholar 

  10. Vallée, B.: Dynamique des fractions continues à contraintes périodiques. J. Number Theor. 72(2), 183–235 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Brigitte Vallée .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berthé, V., Cesaratto, E., Rotondo, P., Vallée, B., Viola, A. (2015). Recurrence Function on Sturmian Words: A Probabilistic Study. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48057-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48057-1_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48056-4

  • Online ISBN: 978-3-662-48057-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics