Abstract
Under some hypotheses, if the image by a morphism of a (k + 1)-power-free word contains a (k + 1)-power, we can reduce this word to obtain a new word with the same scheme. These hypotheses are satisfied in the case of uniform morphisms. This allows us to state that, when k ≥ 4, a k-power-free uniform morphism is a (k + 1)-power-free morphism.
Subject
Computer Science Applications,General Mathematics,Software
Reference23 articles.
1. J. Berstel, Axel Thue’s papers on repetition in words: a translation. Technical Report 20, Laboratoire de Combinatoire et d’Informatique Mathématique, Université du Québec, Montréal (1995).
2. A characterization of overlap-free morphisms
3. Uniformly growing k-th power-free homomorphisms
4. Sharp characterizations of squarefree morphisms
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Power-free complementary binary morphisms;Journal of Combinatorial Theory, Series A;2024-10