Article contents
A test-set for k-power-free binary morphisms
Published online by Cambridge University Press: 15 August 2002
Abstract
A morphism f is k-power-free if and only if f(w) is k-power-free whenever w is a k-power-free word. A morphism f is k-power-free up to m if and only if f(w) is k-power-free whenever w is a k-power-free word of length at most m. Given an integer k ≥ 2, we prove that a binary morphism is k-power-free if and only if it is k-power-free up to k2. This bound becomes linear for primitive morphisms: a binary primitive morphism is k-power-free if and only if it is k-power-free up to 2k+1
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 35 , Issue 5 , September 2001 , pp. 437 - 452
- Copyright
- © EDP Sciences, 2001
References
- 5
- Cited by