Joel Dodge

Learn More
An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. In this paper, we extend the results on unbordered words to unbordered partial words. Partial words are strings that may have a number of ―do not know‖ symbols. We extend a result of Ehrenfeucht and Silberger which states that if a word u can(More)
  • 1