Abstract
We sketch the proof of the following result: the subword complexity of arbitrary morphic sequence is either , or O(n 3/2).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allouche, J.-P., Shallit, J.: Automatic Sequences. Cambridge University Press, Cambridge (2003)
Ferenczi, S.: Complexity of sequences and dynamical systems. Discrete Math. 206(1-3), 145–154 (1999)
Nicolas, F.: Master’s thesis
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)
Author information
Authors and Affiliations
Editor information
Rights 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)