Unbordered Partial Words with a lot of Holes

F. Blanchet-Sadri       Emily Allen       John Lensmire

Abstract       Implementation       Paper      

For a given length n and alphabet size k, the applet below will calculate an upper bound on the maximum number of holes a partial word with these parameters can have and still be unbordered. The program will either conclude that the upper bound is not obtainable, and try to decrease the maximum number of holes, or the program will output the only possible hole positions with the given number of holes. To represent the hole positions in the partial words, all letters will be represented distinctly. We note that these words may fail to be unbordered when the alphabet size is reduced.

This page may not function correctly if you do not have the latest Java Runtime Environment and the latest Java Plugin.

 

Get Java Now!


Partial Words Logo
Valid XHTML 1.0!
Acknowledgement: This material is based upon work supported by the National Science Foundation under Grant No. 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.
NSF
Valid CSS!