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

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

2005-12-13

arxiv.org/abs/cs/0512051v1

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Existence of finite test-sets for k-power-freeness of uniform morphisms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Existence of finite test-sets for k-power-freeness of uniform morphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Existence of finite test-sets for k-power-freeness of uniform morphisms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36234