Skip to main content
SpringerLink
Log in

On Quasiperiodic Morphisms

  • Conference paper
Combinatorics on Words

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

Abstract

Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasiperiodic word. Considering them both on finite and infinite words, we get four families of morphisms between which we study relations. We provide algorithms to decide whether a morphism is strongly quasiperiodic on finite words or on infinite 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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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. Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theoret. Comput. Sci. 119, 247–265 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berstel, J., Séébold, P.: Sturmian words. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 90, pp. 45–110. Cambridge University Press (2002)

    Google Scholar 

  3. Brodal, G.S., Pedersen, C.N.S.: Finding maximal quasiperiodicities in strings. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 397–411. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16, 109–114 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  5. Glen, A., Levé, F., Richomme, G.: Quasiperiodic and Lyndon episturmian words. Theoret. Comput. Sci. 409(3), 578–600 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Groult, R., Richomme, G.: Optimality of some algorithms to detect quasiperiodicities. Theoret. Comput. Sci. 411, 3110–3122 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Iliopoulos, C.S., Mouchard, L.: Quasiperiodicity: from detection to normal forms. Journal of Automata, Languages and Combinatorics 4(3), 213–228 (1999)

    MathSciNet  MATH  Google Scholar 

  8. Lentin, A., Schützenberger, M.P.: A combinatorial problem in the theory of free monoids. In: Bose, R.C., Dowling, T.W. (eds.) Combinatorial Mathematics and its Applications, pp. 128–144. Univ. North Carolina Press (1969)

    Google Scholar 

  9. Levé, F., Richomme, G.: Quasiperiodic infinite words: some answers. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 84, 128–238 (2004)

    MATH  Google Scholar 

  10. Levé, F., Richomme, G.: Quasiperiodic Sturmian words and morphisms. Theoret. Comput. Sci. 372(1), 15–25 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  12. Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press (2002)

    Google Scholar 

  13. Lyndon, R.C., Schützenberger, M.-P.: The equation a m = b n c p in a free group. Michigan Math. J. 9, 289–298 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  14. Marcus, S.: Quasiperiodic infinite words. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 82, 170–174 (2004)

    MATH  Google Scholar 

  15. Marcus, S., Monteil, T.: Quasiperiodic infinite words: multi-scale case and dynamical properties. Technical Report arXiv:math/0603354, arxiv.org (2006)

    Google Scholar 

  16. Richomme, G.: Lyndon morphisms. Bull. Belg. Math. Soc. Simon Stevin 10(5), 761–786 (2003)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire MIS, 33 rue Saint Leu, 80039, Amiens Cedex 1, France

    Florence Levé

  2. UMR 5506, LIRMM (CNRS, Univ. Montpellier 2), CC 477, 161 rue Ada, 34095, Montpellier Cedex 5, France

    Gwénaël Richomme

  3. Dpt MIAp, Univ. Paul-Valéry Montpellier 3, Route de Mende, 34199, Montpellier Cedex 5, France

    Gwénaël Richomme

Authors
  1. Florence Levé
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gwénaël Richomme
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  2. University of Turku, 20014, Turku, Finland

    Arto Lepistö

  3. FUNDIM, University of Turku, Finland

    Luca Zamboni

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levé, F., Richomme, G. (2013). On Quasiperiodic Morphisms. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds) Combinatorics on Words. Lecture Notes in Computer Science, vol 8079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40579-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40579-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40578-5

  • Online ISBN: 978-3-642-40579-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation