Total palindrome complexity of finite words

DOI10.1016/j.disc.2009.08.002zbMath1187.68356MaRDI QIDQ1045150

Valeriu Anisiu, Zoltán Kása, Mira-Cristiana Anisiu

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.08.002

zbMATH Keywords

finite words; palindrome complexity

Mathematics Subject Classification ID

68R15: Combinatorics on words

05A05: Permutations, words, matrices

Related Items

Unnamed Item, Tight bound for the number of distinct palindromes in a tree, HV-Palindromes in Two-Dimensional Words, Rich words in the block reversal of a word, Palindrome pattern matching, On the least number of palindromes in two-dimensional words, Enumeration of two dimensional palindromes, Palindrome Pattern Matching

Cites Work

• Nonrepetitive colorings of trees
• Complexity for finite factors of infinite sequences
• Palindrome complexity bounds for primitive substitution sequences
• Uniformly growing k-th power-free homomorphisms
• Palindrome complexity.
• A note on palindromicity
• On the maximum number of distinct factors of a binary string
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
• Episturmian words and some constructions of de Luca and Rauzy
• Proof of a conjecture on word complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item