A test-set for -power-free binary morphisms
F. Wlazinski (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
A morphism is -power-free if and only if is -power-free whenever is a -power-free word. A morphism is -power-free up to if and only if is -power-free whenever is a -power-free word of length at most . Given an integer ≥ 2, we prove that a binary morphism is -power-free if and only if it is -power-free up to . This bound becomes linear for primitive morphisms: a binary primitive morphism is -power-free if and only if it is -power-free up to ...