Abstract | ||
---|---|---|
We consider so-called Toeplitz words which can be viewed as generalizations of one-way infinite periodic words. We compute their subword complexity, and show that they can always be generated by iterating periodically a finite number of morphisms. Moreover, we define a structural classification of Toeplitz words which is reflected in the way how they can be generated by iterated morphisms. |
Year | DOI | Venue |
---|---|---|
1997 | 10.1006/eujc.1996.0110 | European Journal of Combinatorics |
Keywords | DocType | Volume |
iterated morphisms,toeplitz word,generalized periodicity | Journal | 18 |
Issue | ISSN | Citations |
5 | 0195-6698 | 17 |
PageRank | References | Authors |
1.97 | 6 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Julien Cassaigne | 1 | 282 | 40.80 |
Juhani Karhumäki | 2 | 1115 | 152.77 |