Skip to main content
SpringerLink
Log in

A Local Balance Property of Episturmian Words

  • Conference paper
Developments in Language Theory (DLT 2007)

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

Included in the following conference series:

Abstract

We prove that episturmian words and Arnoux-Rauzy sequences can be characterized using a local balance property. We also give a new characterization of epistandard words.

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

Access this chapter

Log in via an institution
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., Shallit, J.: Automatic sequences. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  2. Arnoux, P., Rauzy, G.: Représentation géométrique de suites de complexités 2n + 1. Bull. Soc. Math. France 119, 199–215 (1991)

    MATH  MathSciNet  Google Scholar 

  3. Berstel, J., Séébold, P.: Algebraic Combinatorics on Words. In: Lothaire, M. (ed.) Sturmian words, vol. 90, ch. 2, Cambridge Mathematical Library (2002)

    Google Scholar 

  4. Berthé, V., Holton, C., Zamboni, L.Q.: Initial powers of sturmian sequences. Acta. arithmetica 122, 315–347 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cassaigne, J.: Complexité et facteurs spéciaux. Belg. Bull. Math. Soc. 4, 67–88 (1997)

    MATH  MathSciNet  Google Scholar 

  6. Cassaigne, J., Ferenczi, S., Zamboni, L.Q.: Imbalances in Arnoux-Rauzy sequences. Ann. Inst. Fourier, Grenoble 50(4), 1265–1276 (2000)

    MATH  MathSciNet  Google Scholar 

  7. Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Math. Syst. Th. 7, 138–153 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  8. de Luca, A.: On standard Sturmian morphisms. Theoretical Computer Science 178, 205–224 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoretical Computer Science 255, 539–553 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dulucq, S., Gouyou-Beauchamps, D.: Sur les facteurs des suites de Sturm. Theoretical Computer Science 71, 381–400 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  11. Glen, A.: A characterization of fine words over a finite alphabet. In: International School and Conference on Combinatorics, Automata and Number Theory (Cant 2006), p. 9. Université de Liège, Belgium (2006)

    Google Scholar 

  12. Glen, A., Justin, J., Pirillo, G.: Characterizations of finite and infinite episturmian words via lexicographic orderings (submitted, 2006)

    Google Scholar 

  13. Hubert, P.: Suites équilibrées. Theoretical Computer Science 242, 91–108 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  14. Justin, J., Pirillo, G.: Episturmian words and episturmian morphisms. Theoretical Computer Science 276(1-2), 281–313 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Justin, J., Vuillon, L.: Return words in Sturmian and episturmian words. RAIRO Theoret. Infor. Appl. 34, 343–356 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Levé, F., Richomme, G.: Quasiperiodic infinite words: some answers. Bull. Europ. Assoc. Theoret. Comput. Sci. 84, 128–238 (2004)

    Google Scholar 

  17. Levé, F., Richomme, G.: Quasiperiodic Sturmian words and morphisms. Theoretical Computer Science 372(1), 15–25 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Lothaire, M.: Combinatorics on words. Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley, London (1997) Reprinted in the Cambridge Mathematical Library, Cambridge University Press, UK, 1997

    MATH  Google Scholar 

  19. Morse, M., Hedlund, G.A.: Symbolic Dynamics II: Sturmian trajectories. Amer. J. Math. 61, 1–42 (1940)

    Article  MathSciNet  Google Scholar 

  20. Pytheas Fogg, N.: Substitutions in Dynamics, Arithmetics and Combinatorics. In: Berthé, V., Ferenczi, S., Mauduit, C., Siegel, A. (eds.) Frontiers of Combining Systems. LNCS, vol. 1794, Springer, Heidelberg (2000)

    Google Scholar 

  21. Richomme, G.: Conjugacy and episturmian morphisms. Theoretical Computer Science 302, 1–34 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  22. Richomme, G.: Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. Theoretical Computer Science (Words 2005 special number) (to appear)

    Google Scholar 

  23. Vuillon, L.: Balanced words. Bull. Belg. Math.Soc. 10(5), 787–805 (2003)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UPJV, LaRIA, 33, Rue Saint Leu, 80039 Amiens cedex 01, France

    Gwénaël Richomme

Authors
  1. Gwénaël Richomme
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tero Harju Juhani Karhumäki Arto Lepistö

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Richomme, G. (2007). A Local Balance Property of Episturmian Words. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73208-2_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73207-5

  • Online ISBN: 978-3-540-73208-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation