Initial non-repetitive complexity of infinite words
Combinatorics
2016-01-15 v3 Formal Languages and Automata Theory
Abstract
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 appear at the beginning of x prior to the first repetition of a length-n factor. We examine general properties of the initial non-repetitive complexity function, as well as obtain formulas for the initial non-repetitive complexity of the Thue-Morse word, the Fibonacci word and the Tribonacci word.
Cite
@article{arxiv.1507.08206,
title = {Initial non-repetitive complexity of infinite words},
author = {Jeremy Nicholson and Narad Rampersad},
journal= {arXiv preprint arXiv:1507.08206},
year = {2016}
}
Comments
21 pages; changed "non-repetitive complexity" to "initial non-repetitive complexity"