Pseudo-Power Avoidance

Details Pseudo-Power Avoidance Pseudo-Power Avoidance

2009-11-11

arxiv.org/abs/0911.2233v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

Repetition avoidance has been studied since Thue's work. In this paper, we considered another type of repetition, which is called pseudo-power. This concept is inspired by Watson-Crick complementarity in DNA sequence and is defined over an antimorphic involution $\phi$. We first classify the alphabet $\Sigma$ and the antimorphic involution $\phi$, under which there exists sufficiently long pseudo-$k$th-power-free words. Then we present algorithms to test whether a finite word $w$ is pseudo-$k$th-power-free.

Affiliated with

Also associated with

No associations

Rating

Pseudo-Power Avoidance 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 Pseudo-Power Avoidance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudo-Power Avoidance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149573