Counting Primitive Partial Words
F. Blanchet-Sadri, Mihai Cucuringu · Universitätsbibliothek Gießen · 2010
A word is primitive if it is not a power of another word. The number of primitive words of a fixed length over an alphabet of a fixed size is well known and relates to the Möbius function. In this paper, we investigate the number of primitive partial words which are strings that may contain "do not know" symbols.