kth power-free codes. (English) Zbl 0571.68054

Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 172-187 (1985).
[For the entire collection see Zbl 0563.00019.]
A word is called kth power-free if none of its non-empty factors has the form \(u^ k\). A morphism is a kth power-free morphism if it preserves the kth power-free words. We present some conditions for some particular morphisms to be kth power-free. As a matter of fact we claim that the framework of the theory of codes is a good framework for these problems and we try to illustrate this.


68Q45 Formal languages and automata


Zbl 0563.00019