Complexity and palindromic defect of infinite words
type: Item
instance of: scholarly article
title: Complexity and palindromic defect of infinite words
zbMATH Open document ID: 1209.68395
author: Christophe Reutenauer
author: Srečko Brlek
published in: Theoretical Computer Science
publication date: 2011-02-02T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5843658
zbMATH Keywords: complexity
zbMATH Keywords: palindromic complexity
zbMATH Keywords: palindromic defect
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.11.025
OpenAlex ID: W2086603341
cites work: On the complexity of infinite sequences
cites work: Palindrome complexity.
cites work: Factor versus palindromic complexity of uniformly recurrent infinite words
cites work: Q3077342
cites work: Enumeration of factors in the Thue-Morse word
cites work: ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
cites work: A note on differentiable palindromes.
cites work: A connection between palindromic and factor complexity using return words
cites work: Q4714446
cites work: Episturmian words and some constructions of de Luca and Rauzy
cites work: Rich, Sturmian, and trapezoidal words
cites work: Q3332270
DOI: 10.1016/J.TCS.2010.11.025
description: scientific article; zbMATH DE number 5843658