Skip to main content
SpringerLink
Log in

On Subword Complexity of Morphic Sequences

  • Conference paper
Computer Science – Theory and Applications (CSR 2008)

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

Included in the following conference series:

Abstract

We sketch the proof of the following result: the subword complexity of arbitrary morphic sequence is either , or O(n 3/2).

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. Ferenczi, S.: Complexity of sequences and dynamical systems. Discrete Math. 206(1-3), 145–154 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Nicolas, F.: Master’s thesis

    Google Scholar 

  4. Pansiot, J.-J.: Complexité des facteurs des mots infinis engendrés par morphimes itérés. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 380–389. Springer, Heidelberg (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University and Independent University of Moscow,  

    Rostislav Deviatov

Authors
  1. Rostislav Deviatov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edward A. Hirsch Alexander A. Razborov Alexei Semenov Anatol Slissenko

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deviatov, R. (2008). On Subword Complexity of Morphic Sequences. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds) Computer Science – Theory and Applications. CSR 2008. Lecture Notes in Computer Science, vol 5010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79709-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79709-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79708-1

  • Online ISBN: 978-3-540-79709-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation