Logo image
Retour
Existence of finite test-sets for k-power-freeness of uniform morphisms
Article de revue scientifique   Avec comité de lecture

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

Gwenaël Richomme et Francis Wlazinski
Discrete Applied Mathematics, Vol.155(15), p.2001-2016
15/09/2007
DOI: https://doi.org/10.1016/j.dam.2007.04.024

Résumé

Computer Science Discrete Mathematics
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.

Indicateurs

1 Consultations de la notice

Détails

Logo image