Francine Blanchet-Sadri           Brian Bowers           Nathan Fox

                                   

We consider some counting problems on partial words:

1. Count partial words of a given length using a given number of letters that give rise to distinct border arrays;
2. Count primitive and abelian primitive partial words of a given length over a given alphabet size.

Keywords: Combinatorics on words; Bordered partial words; Primitive partial words; Abelian primitive partial words.

---

		Acknowledgement:   This material is based upon work supported by the National Science Foundation under Grant No. DMS-1060775.
		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.