Showing math.COShow all
2 papers · 1 filter
math.CO2015
Initial non-repetitive complexity of infinite words
Jeremy Nicholson, Narad Rampersad
The initial non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that a…
math.CO2015
Improved estimates for the number of privileged words
Jeremy Nicholson, Narad Rampersad
In combinatorics on words, a word w of length n over an alphabet of size q is said to be privileged if n <= 1 or if n >= 2 and w has a privileged border that occurs exactly twice i…