Note: Complexity and palindromic defect of infinite words

Authors:
S. Brlek;C. Reutenauer
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2011

Citing 7
Cited 3

Combinatorics of words

Handbook of formal languages, vol. 1
Episturmian words and some constructions of de Luca and Rauzy

Theoretical Computer Science
Palindrome complexity

Theoretical Computer Science
Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphimes iteres

STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
A note on differentiable palindromes

Theoretical Computer Science
Factor versus palindromic complexity of uniformly recurrent infinite words

Theoretical Computer Science
Note: Rich, Sturmian, and trapezoidal words

Theoretical Computer Science

On Brlek-Reutenauer conjecture

Theoretical Computer Science
Proof of the Brlek-Reutenauer conjecture

Theoretical Computer Science
Palindromic richness for languages invariant under more symmetries

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this note, we state a conjecture, and prove it in the periodic case, which is an equality relating the number of factors and palindromic factors of infinite words. This equality establishes a link between two inequalities, one due to Droubay, Justin and Pirillo, and the other to Balazi, Masakova and Pelantova, by means of the palindromic defect.