Skip to main content
SpringerLink
Log in

Bisections of free monoids and a new unavoidable regularity

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

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

  • 134 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lothaire M., Combinatorics on words, Addison-Wesley (1983)

    Google Scholar 

  2. Christophe Reutenauer, Mots de Lyndon et un théorème de Shirshov, Preprint (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Universita, “La Sapienza”, Piazzale Aldo Moro 2, 00185, Roma, Italy

    Stefano Varricchio

Authors
  1. Stefano Varricchio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Varricchio, S. (1988). Bisections of free monoids and a new unavoidable regularity. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017177

Download citation

  • DOI: https://doi.org/10.1007/BFb0017177

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation