Total palindrome complexity of finite words
type: Item
instance of: scholarly article
title: Total palindrome complexity of finite words
zbMATH Open document ID: 1187.68356
author: Mira-Cristiana Anisiu
author: Valeriu Anisiu
author: Zoltán Kása
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 5648177
zbMATH Keywords: palindrome complexity
zbMATH Keywords: finite words
MaRDI profile type: Publication
full work available at URL: j.disc.2009.08.002
OpenAlex ID: W2151180867
cites work: Palindrome complexity.
cites work: Q3077265
cites work: A note on palindromicity
cites work: Palindromes and two-dimensional Sturmian sequences
cites work: Uniformly growing k-th power-free homomorphisms
cites work: ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
cites work: Nonrepetitive colorings of trees
cites work: COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
cites work: Palindrome complexity bounds for primitive substitution sequences
cites work: Episturmian words and some constructions of de Luca and Rauzy
cites work: Complexity for finite factors of infinite sequences
cites work: Q3814828
cites work: Q4258669
cites work: Proof of a conjecture on word complexity
cites work: On the maximum number of distinct factors of a binary string
DOI: 10.1016/J.DISC.2009.08.002
description: scientific article; zbMATH DE number 5648177