Existence of finite test-sets for k-power-freeness of uniform morphisms
classification
💻 cs.DM
keywords
algorithmcasefinitek-power-freenessmorphismstest-setsuniformchallenging
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.