Existence of finite test-sets for k-power-freeness of uniform morphisms

Gwenaël Richomme (1) , Francis Wlazinski (1)

1 LaRIA - Laboratoire de Recherche en Informatique d'Amiens

A challenging problem is to find an algorithm to decide whether a morphism is k-power-free. We provide such an algorithm when k >= 3 for uniform morphisms showing that in such a case, contrarily to the general case, there exist finite test-sets for k-power-freeness.

Mots clés: Formal Languages; Combinatorics on words; k-power-free words; morphisms; test-sets

Domaines: Mathématique discrète [cs.DM]

Gwenaël Richomme, Francis Wlazinski. Existence of finite test-sets for k-power-freeness of uniform morphisms. Discrete Applied Mathematics, 2007, 155 (15), pp.2001-2016. ⟨hal-00015775⟩