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

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