Generalized de Bruijn words for Primitive words and Powers

Yu Hin Au

We show that for every $n\ge 1$ and over any finite alphabet, there is a word whose circular factors of length $n$ have a one-to-one correspondence with the set of primitive word…