Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms

Author: Cassaigne J.   Karhumaki J.  

Publisher: Academic Press

ISSN: 0195-6698

Source: European Journal of Combinatorics, Vol.18, Iss.5, 1997-07, pp. : 497-510

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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 in which they can be generated by iterated morphisms.