Complexity and palindromic defect of infinite words

DOI10.1016/J.TCS.2010.11.025zbMath1209.68395OpenAlexW2086603341MaRDI QIDQ620969

Christophe Reutenauer, Srečko Brlek

Publication date: 2 February 2011

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.025

zbMATH Keywords

complexitypalindromic defectpalindromic complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Palindromic Complexity of Trees ⋮ Languages invariant under more symmetries: overlapping factors versus palindromic richness ⋮ Palindromic richness for languages invariant under more symmetries ⋮ Extensions of rich words ⋮ On highly potential words ⋮ On generalized highly potential words ⋮ On Brlek-Reutenauer conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rich, Sturmian, and trapezoidal words
• On the complexity of infinite sequences
• A note on differentiable palindromes.
• Enumeration of factors in the Thue-Morse word
• Palindrome complexity.
• Factor versus palindromic complexity of uniformly recurrent infinite words
• A connection between palindromic and factor complexity using return words
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Complexity and palindromic defect of infinite words