Skip to main content

A characterization of Sturmian morphisms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 711))

Abstract

A morphism is called Sturmian if it preserves all Sturmian (infinite) words. It is weakly Sturmian if it preserves at least one Sturmian word. We prove that a morphism is Sturmian if and only if it keeps the word ba 2 ba 2 baba 2 bab balanced. As a consequence, weakly Sturmian morphisms are Sturmian. An application to infinite words associated to irrational numbers is given.

Partially supported by the PRC “Mathématiques et Informatique”.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Bombieri, J. E. Taylor, Which distributions of matter diffract? An initial investigation, J. Phys. 47 (1986), Colloque C3, 19–28.

    Google Scholar 

  2. J. E. Bresenham, Algorithm for computer control of a digital plotter, IBM Systems J.4 (1965), 25–30.

    Google Scholar 

  3. T. C. Brown, A characterization of the quadratic irrationals, Canad. Math. Bull.34 (1991), 36–41.

    Google Scholar 

  4. T. C. Brown, Descriptions of the characteristic sequence of an irrational, Canad. Math. Bull.36 (1993), 15–21.

    Google Scholar 

  5. D. Crisp, W. Moran, A. Pollington, P. Shiue, Substitution invariant cutting sequences, Sémin. Théorie des Nombres, Bordeaux, 1993, to appear.

    Google Scholar 

  6. E. Coven, G. Hedlund, Sequences with minimal block growth, Math. Systems Theory7 (1973), 138–153.

    Google Scholar 

  7. S. Dulucq, D. Gouyou-Beauchamps, Sur les facteurs des suites de Sturm, Theoret. Comput. Sci.71 (1990), 381–400.

    Google Scholar 

  8. A. S. Fraenkel, M. Mushkin, U. Tassa, Determination of ⌊⌋ by its sequence of differences, Canad. Math. Bull.21 (1978), 441–446.

    Google Scholar 

  9. G.A. Hedlund, Sturmian minimal sets, Amer. J. Math66 (1944), 605–620.

    Google Scholar 

  10. G.A. Hedlund, M. Morse, Symbolic dynamics, Amer. J. Math60 (1938), 815–866.

    Google Scholar 

  11. G.A. Hedlund, M. Morse, Sturmian sequences, Amer. J. Math61 (1940), 1–42.

    Google Scholar 

  12. S. Ito, S. Yasutomi, On continued fractions, substitutions and characteristic sequences, Japan. J. Math.16 (1990), 287–306.

    Google Scholar 

  13. F. Mignosi, On the number of factors of Sturmian words, Theoret. Comput. Sci.82 (1991), 71–84.

    Google Scholar 

  14. F. Mignosi, P. Séébold, Morphismes sturmiens et règles de Rauzy, Techn. Rep. LITP-91-74, Paris, France.

    Google Scholar 

  15. M. Queffélec, Substitution Dynamical Systems — Spectral Analysis, Lecture Notes Math.,vol. 1294, Springer-Verlag, 1987.

    Google Scholar 

  16. G. Rauzy, Suites à termes dans un alphabet fini, Sémin. Théorie des Nombres (1982–1983), 25–01,25–16, Bordeaux.

    Google Scholar 

  17. G. Rauzy, Mots infinis en arithmétique, in: Automata on infinite words (D. Perrin ed.), Lect. Notes Comp. Sci. 192 (1985), 165–171.

    Google Scholar 

  18. G. Rauzy, Sequences defined by iterated morphisms, in: Workshop on Sequences (R. Capocelli ed.), Lecture Notes Comput. Sci., to appear.

    Google Scholar 

  19. P. Séébold, Fibonacci morphisms and Sturmian words, Theoret. Comput. Sci.88 (1991), 367–384.

    Google Scholar 

  20. C. Series, The geometry of Markoff numbers, The Mathematical Intelligencer7 (1985), 20–29.

    Google Scholar 

  21. K. B. Stolarsky, Beatty sequences, continued fractions, and certain shift operators, Cand. Math. Bull.19 (1976), 473–482.

    Google Scholar 

  22. B. A. Venkov, Elementary Number Theory, Wolters-Noordhoff, Groningen, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berstel, J., Séébold, P. (1993). A characterization of Sturmian morphisms. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics