Counting the Number of Non-Simply Bordered Partial Words
Enter the number of holes in the partial word (0 or 1), h, the number of letters in the alphabet, k, and the length of the word, n.

---

Acknowledgement:   This material is based upon work supported by the National Science Foundation under Grant No. DMS-0452020 and DMS-0754154. The Department of Defense is also gratefully acknowledged.

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.

---