On Minimal Sturmian Partial Words

Francine Blanchet-Sadri & John Lensmire
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A_diamond=A cup {diamond}$ where {diamond} stands for a hole and matches (or is compatible with every letter in A. The subword complexity of a partial word w, denoted by p_w(n), is the number of distinct full words (those without holes) over the alphabet that are compatible with factors of length n of w....
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.