In this paper, we investigate the problem of computing the maximum number of holes a partial word of fixed length can have and still fail to be bordered. This problem is related to the one of counting unbordered partial words.
Keywords: Combinatorics on words; Partial Words; Unbordered Words; Unbordered partial words.
|
|
| Acknowledgement: | This material is based upon work supported by the National Science Foundation under Grant No.
DMS-0754154. |
| 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. |
|
|
