Initial non-repetitive complexity of infinite words

DOI10.1016/j.dam.2016.03.010zbMath1342.68262arXiv1507.08206OpenAlexW2962837101MaRDI QIDQ284845

Jeremy Nicholson, Narad Rampersad

Publication date: 18 May 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.08206

zbMATH Keywords

Fibonacci wordinitial non-repetitive complexitysquarefree wordThue-Morse wordTribonacci word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items

On non-repetitive complexity of Arnoux-Rauzy words ⋮ Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents

Cites Work

• Eulerian entropy and non-repetitive subword complexity
• Balance and abelian complexity of the Tribonacci word
• Avoiding squares and overlaps over the natural numbers
• Avoidable patterns in strings of symbols
• Periodicity and the golden ratio
• Uniformly growing k-th power-free homomorphisms
• Palindrome complexity.
• Enumeration and structure of trapezoidal words
• On extending de Bruijn sequences
• Some properties of the Tribonacci sequence
• Open and Closed Prefixes of Sturmian Words
• Automatic Sequences
• A problem in arrangements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item