Pages that link to "Item:Q1045150"
From MaRDI portal
The following pages link to Total palindrome complexity of finite words (Q1045150):
Displaying 18 items.
- On the avoidability index of palindromes (Q351673) (← links)
- On the least number of palindromes contained in an infinite word (Q385043) (← links)
- Palindrome pattern matching (Q390901) (← links)
- On palindromic factorization of words (Q394756) (← links)
- Palindromes in circular words (Q401312) (← links)
- Palindromic complexity of codings of rotations (Q650872) (← links)
- Palindrome complexity bounds for primitive substitution sequences (Q1579570) (← links)
- Palindrome complexity. (Q1853729) (← links)
- On the least number of palindromes in two-dimensional words (Q2286748) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- Enumeration of two dimensional palindromes (Q2672656) (← links)
- Palindrome Pattern Matching (Q3011857) (← links)
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS (Q3021999) (← links)
- (Q3598613) (← links)
- On the characterization of tripled partial metrics and tripled quasi-metrics (Q5050542) (← links)
- Tight bound for the number of distinct palindromes in a tree (Q6042101) (← links)
- HV-Palindromes in Two-Dimensional Words (Q6114875) (← links)
- Rich words in the block reversal of a word (Q6157425) (← links)