Article ID Journal Published Year Pages File Type
10334742 Theoretical Computer Science 2005 15 Pages PDF
Abstract
Michaux and Villemaire's proof of Cobham's theorem relies on the characterization of ultimately periodic words by means of the behaviour of certain repetitions in the word. Namely, they consider the length of the smallest shift between repetitions of a given length and the first position at which that smallest shift is observed. In this paper we study those properties for characteristic Sturmian words. In particular we answer a question posed by Michaux and Villemaire in that context.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,