RAIRO-Theor. Inf. Appl.
Volume 50, Number 1, January-March 2016Special issue dedicated to the 15th "Journées Montoises d'Informatique Théorique"
|Page(s)||3 - 20|
|Published online||08 June 2016|
Reduction in non-(k + 1)-power-free morphisms
L.A.M.F.A., UMR 7352 du CNRS, Université de Picardie Jules
Verne, 33 rue
Amiens cedex 1,
Accepted: 24 March 2016
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.
Mathematics Subject Classification: 68R15
Key words: Word / morphism / uniform and k-power
© EDP Sciences 2016
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.