Skip to main content

On the Frequency of Letters in Morphic Sequences

  • Conference paper
Book cover Computer Science – Theory and Applications (CSR 2006)

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

Included in the following conference series:

Abstract

A necessary and sufficient criterion for the existence and value of the frequency of a letter in a morphic sequence is given. This is done using a certain incidence matrix associated with the morphic sequence. The characterization gives rise to a simple if-and-only-if condition that all letter frequencies exist.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. In: Theory, applications, generalizations. Cambridge University Press, Cambridge (2003)

    Chapter  Google Scholar 

  2. Apostol, T.M.: Introduction to the Analytic Number Theory. Springer, Heidelberg (1976)

    MATH  Google Scholar 

  3. Dekking, F.M.: On the Thue-Morse measure. Acta Univ. Carolin. Math. Phys. 33, 35–40 (1992)

    MathSciNet  MATH  Google Scholar 

  4. Frid, A.: On the frequency of factors in a DOL word. J. Autom. Lang. Comb. 3(1), 29–41 (1998)

    MathSciNet  MATH  Google Scholar 

  5. Gantmacher, F.R.: The theory of matrices, vol. 1, 2. Chelsea Publishing Co., New York (1959)

    MATH  Google Scholar 

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

    Google Scholar 

  7. 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 

  8. Minc, H.: Nonnegative matrices. Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York (1988)

    MATH  Google Scholar 

  9. Peter, M.: The asymptotic distribution of elements in automatic sequences. Theoretical Computer Science 301, 285–312 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Pullman, N.J.: Matrix theory and its applications. In: Pure and Applied Mathematics (Selected topics), vol. 35, Marcel Dekker, Inc., New York (1976)

    Google Scholar 

  11. Queffélec, M.: Substitution dynamical systems—spectral analysis. Lecture Notes in Mathematics, vol. 1294. Springer, Berlin (1987)

    Book  MATH  Google Scholar 

  12. Saari, K.: On the Frequency of Letters in Pure Binary Morphic Sequences. Developments in language theory, 397–408 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saari, K. (2006). On the Frequency of Letters in Morphic Sequences. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_34

Download citation

  • DOI: https://doi.org/10.1007/11753728_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34166-6

  • Online ISBN: 978-3-540-34168-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics