Existence of finite test-sets for k-power-freeness of uniform morphisms
<|reference_start|>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. 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.<|reference_end|>
@article{richomme2005existence,
    title={Existence of finite test-sets for k-power-freeness of uniform morphisms},
    author={Gw'ena"el Richomme (LaRIA), Francis Wlazinski (LaRIA)},
    journal={arXiv preprint arXiv:cs/0512051},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0512051},
    primaryClass={cs.DM}
}