The seminal theorem of Cobham has given rise during the last 40 years to a lot of works about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences.
Let and be two multiplicatively independent Perron numbers. Then, a sequence , where is a finite alphabet, is both -substitutive and -substitutive if and only if is ultimately periodic.
Cite this article
Fabien Durand, Cobham's theorem for substitutions. J. Eur. Math. Soc. 13 (2011), no. 6, pp. 1799–1814