Click to go to Francine Blanchet-Sadri's website


Abstract

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.


N1,k(n)

The number of nonprimitive partial words of length n with 1 hole over a k-size alphabet










   


      Visit the NSF Website        

Acknowledgement: This material is based upon work supported by the National Science Foundation under Grant No. DMS-0452020.

Disclaimer: Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.

      Visit the Partial Words Page     



Valid XHTML 1.0 Strict       Valid CSS!

Implementations and web pages by A. Brent Rudd