Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420021 | Discrete Applied Mathematics | 2016 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
G. Richomme, F. Wlazinski,