Rich square-free words

DOI10.1016/J.TCS.2017.05.003zbMath1376.68120arXiv1603.01058OpenAlexW2964254337MaRDI QIDQ2357378

Jetro Vesti

Publication date: 13 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

combinatorics on wordspalindromesrich wordssquare-free words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

On generalized highly potential words ⋮ Ostrowski-automatic sequences: theory and applications ⋮ On highly palindromic words: the ternary case

Cites Work

• Unnamed Item
• Unnamed Item
• Languages invariant under more symmetries: overlapping factors versus palindromic richness
• Extensions of rich words
• Last cases of Dejean's conjecture
• Rich, Sturmian, and trapezoidal words
• Substitution dynamical systems. Spectral analysis
• Palindromic richness
• Special factors, periodicity, and an application to Sturmian words
• A new characteristic property of rich words
• Burrows-Wheeler transform and palindromic richness
• Palindromic complexity of infinite words associated with simple Parry numbers
• A connection between palindromic and factor complexity using return words
• Sur un théorème de Thue
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• A proof of Dejean’s conjecture
• Repetitions in the Fibonacci infinite word
• Three Series for the Generalized Golden Mean
• Episturmian words: a survey
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Rich square-free words