On Subword Complexity of Morphic Sequences
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5010)
We sketch the proof of the following result: the subword complexity of arbitrary morphic sequence is either Open image in new window , or O(n 3/2).
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2008