De Bruijn sequences on primitive words and squares

Details De Bruijn sequences on primitive words and squares De Bruijn sequences on primitive words and squares

2009-04-25

arxiv.org/abs/0904.3997v2

Mathematics

Combinatorics

Scientific paper

We present a simple algorithm that generates a De Bruijn sequence of the set
of primitive words of any given length over any alphabet. We also show that the
shortest sequence that contains all squares of length 2n over an alphabet of
size k has length between 2k^n and (2+ 1/k)k^n.

Affiliated with

Also associated with

No associations

Rating

De Bruijn sequences on primitive words and squares 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 De Bruijn sequences on primitive words and squares, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and De Bruijn sequences on primitive words and squares will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671493