Total palindrome complexity of finite words

DOI10.1016/J.DISC.2009.08.002zbMath1187.68356OpenAlexW2151180867MaRDI 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 wordspalindrome complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (8)

Palindrome pattern matching ⋮ Enumeration of two dimensional palindromes ⋮ 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 ⋮ Unnamed Item ⋮ Palindrome Pattern Matching ⋮ On the least number of palindromes in two-dimensional words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Total palindrome complexity of finite words