Skip to main content

Generalized Sturmian languages

  • Automata and Formal Languages II
  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1995)

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

Included in the following conference series:

Abstract

The purpose of this paper is to generalize some recent results about Sturmian words and morphisms. This is done by introducing a new mathematical interpretation of them, using the modern topological framework of laminations and train tracks. The main result is a description of a class of languages invariant by the action of a finitely generated monoid of morphisms (where classical Sturmian objects represent the case over an alphabet of two letters). We also discuss how these languages can be effectively constructed, and we show how topological results about Pseudo-Anosov homeomorphisms can be proved in terms of D0L-systems theory.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birman J.S.-Mapping class groups of surfaces. In: Braids.-AMS, 1988.

    Google Scholar 

  2. Berstel J. and Séébold P.-Morphismes de Sturm. Bull. of the Belg. Math. Soc., vol. 1, number 2, 1994, pp. 175–190.

    Google Scholar 

  3. Casson A.J.-Automorphisms of Surfaces after Nielsen and Thurston.-London Mathematical Society, 1988.

    Google Scholar 

  4. Coven E.M. and Headlund G.-Sequences with minimal block growth. Math. Sys. Th., vol. 7, 1973, pp. 138–073.

    Google Scholar 

  5. Crisp D., Moran W., Pollington A. and Shiue P.-Substitution invariant cutting sequences. J. de Th. des Nombres de Bordeaux, 5, number 1, 1993, pp. 073–138.

    Google Scholar 

  6. Coven E.M.-Sequences with minimal block growth II. Math. Sys. Th., vol. 8, 1974, pp. 376–382.

    Google Scholar 

  7. Dulucq S. and Gouyou-Beauchamps.-Sur les facteurs des suites de Sturm. Theoretical Computer Science, vol. 71, 1990, pp. 381–400.

    Google Scholar 

  8. De Luca A. and Mignosi F.-On some combinatorial properties of Sturmian words. Theoretical Computer Science, 1994.-to appear.

    Google Scholar 

  9. Ehrenfeucht A. and Rozenberg G.-Repetitions of subwords in D0L languages. Information and Control, vol. 59, 1983, pp. 13–35.

    Google Scholar 

  10. Gottschalk W.H. and Hedlund G.A.-Topological dynamics. AMS Colloq. Pub., vol. 36, 1955.

    Google Scholar 

  11. Hatcher A.E.-Measured laminations spaces for surfaces from the topological viewpoint. Topology and its Applications, vol. 30, 1988, pp. 63–88.

    Google Scholar 

  12. Hedlund G.-Sturmian minimal sets. Amer. Journal of Math., vol. 66, 1944, pp. 605–620.

    Google Scholar 

  13. Keane M.S.-Ergodic theory and subshifts of finite type, chap. 2.-Oxford Univ. Press, 1991. Bedford, T. and Keane, M. and Series, C., Editors.

    Google Scholar 

  14. KÒsa M.-Problem. Bull. EATCS, vol. 32, 1987, pp. 331–333.

    Google Scholar 

  15. Markov A.-Sur une question de Jean Bernoulli. Math. Ann., vol. 19, 1882, pp. 27–36.

    Google Scholar 

  16. Morse M. and Hedlund G.A.-Symbolic dynamics I. American Journal of Mathematics, vol. 60, 1938, pp. 807–866.

    Google Scholar 

  17. Morse M. and Hedlund G.A.-Symbolic dynamics II. Sturmian trajectories. American Journal of Mathematics, vol. 62, 1940, pp. 1–42.

    Google Scholar 

  18. Mignosi F.-Infinite words with linear subword complexity. Theoretical Computer Science, vol. 65, 1989, pp. 221–242.

    Google Scholar 

  19. Mignosi F. and Séébold P.-Morphismes Sturmiens et règles de Rauzy. J. de Th. des Nombres de Bordeaux, vol. 5, number 2, 1993, pp. 221–234.

    Google Scholar 

  20. Narbel Ph.-The boundary of iterated morphisms on free semi-groups.-1995. To appear in International Journal of Algebra and Computation.

    Google Scholar 

  21. Paul M.-Minimal symbolic flows having minimal block growth. Math. Sys. Th., vol. 8, 1974, pp. 307–307.

    Google Scholar 

  22. Penner R.C.-A construction of pseudo-Anosov homeomorphisms. Transc. of the Amer. Math. Soc., vol. 310, number 1, 1988, pp. 179–197.

    Google Scholar 

  23. Penner R.C. and Harer J.L.-Combinatorics of train tracks.-Princeton University Press, 1993, Annals of Math. Studies. Study 075.

    Google Scholar 

  24. Rozenberg G. and Salomaa A.-The mathematical theory of L systems.-Academic press, 1980.

    Google Scholar 

  25. Séébold P.-Fibonacci mophisms and Sturmian words. Theoretical Computer Science, vol. 88, 1991, pp. 367–384.

    Google Scholar 

  26. Séébold P.-Problèmes combinatoires liés à la génération de mots infinis ayant des facteurs prescrits.-Tech. Rep. 92-07, LITP, Paris 7, 1992. Habilitation Thesis.

    Google Scholar 

  27. Series C.-Geometrical Markov coding of geodesics on surfaces of constant negative curvature. Ergod. Th. and Dynam. Sys., vol. 6, 1986, pp. 601–625.

    Google Scholar 

  28. Thurston W.-The geometry and topology of 3-manifolds.-Princeton University Lecture Notes.

    Google Scholar 

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

    Google Scholar 

  30. Weiss H.-The geometry of measured geodesic laminations and measured train tracks. Ergod. Th. and Dynam. Sys., vol. 9, 1989, pp. 587–604.

    Google Scholar 

  31. Wen Z-X. and Wen Z-Y.-Local isomorphisms of invertible substitutions. C.R. Acad. Sci. Paris, vol. 318, 1994, pp. 299–304.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lopez, LM., Narbel, P. (1995). Generalized Sturmian languages. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_86

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_86

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics