RAIRO-Theor. Inf. Appl.
Volume 35, Number 5, September October 2001
|Page(s)||437 - 452|
|Published online||15 August 2002|
A test-set for k-power-free binary morphisms
LaRIA, Université de Picardie Jules Verne, 5 rue du Moulin Neuf,
80000 Amiens, France; email@example.com.
Accepted: November 2001
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
Mathematics Subject Classification: 68R15
Key words: Combinatorics on words / k-power-free words / morphisms / test-sets
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.