Skip to main content

On the Frequency of Letters in Pure Binary Morphic Sequences

  • 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

It is well-known that the frequency of letters in primitive morphic sequences exists. We show that the frequency of letters exists in pure binary morphic sequences generated by non-primitive morphisms. Therefore, the letter frequency exists in every pure binary morphic sequence. We also show that this is somewhat optimal, in the sense that the result does not hold in the class of general binary morphic sequences. Finally, we give an explicit formula for the frequency of letters.

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

Access this chapter

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., Davison, J.L., Queffélec, M., Zamboni, L.Q.: Transcendence of Sturmian or morphic continued fractions. J. Number Theory 91(1), 39–66 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Allouche, J.-P., Shallit, J.: Automatic Sequences, Cambridge (2003)

    Google Scholar 

  3. Cobham, A.: Uniform tag sequences. Math. Systems Theory 6, 164–192 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  4. Michel, P.: Sur les ensembles minimaux engendrés par les substitutions de longueur non constante. Ph. D. Thesis, Université de Rennes (1975)

    Google Scholar 

  5. Michel, P.: Stricte ergodicité d’ensembles minimaux de substitution. In: Conze, J.-P., Keane, M.S. (eds.) Théorie Ergodique: Actes des Journées Ergodiques, Rennes 1973/1974. Lecture Notes in Mathematics, vol. 532, pp. 189–201. Springer, Heidelberg (1976)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saari, K. (2005). On the Frequency of Letters in Pure Binary Morphic Sequences. 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_35

Download citation

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

  • 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