Recurrence and Subword Complexity in Partial Words

Partial words are sequences over a finite alphabet that may contain wildcard symbols called holes which are compatible with all letters. In this paper, we consider the topic of recurrence and subword complexity over partial words.

Keywords: Combinatorics on words; Partial words; Subword Complexity; Recurrent Words; Uniform Recurrence; Representable sets.