Jeremy Nicholson, Narad Rampersad
Published 2015-07-29Version 1
The 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 appear at the beginning of x prior to the first repetition of a length-n factor. We examine general properties of the non-repetitive complexity function, as well as obtain formulas for the non-repetitive complexity of the Thue-Morse word, the Fibonacci word and the Tribonacci word.
More properties of the Fibonacci word on an infinite alphabet
On additive properties of sets defined by the Thue-Morse word
On a generalization of Abelian equivalence and complexity of infinite words
![QR code for arXiv:1507.08206 [math.CO]](http://oss.arxitics.com/images/favicon.svg)