The following pages link to On highly palindromic words (Q1028422):
Displaying 9 items.
- Unavoidable regularities in long words with bounded number of symbol occurrences (Q386431) (← links)
- Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words (Q765352) (← links)
- On highly palindromic words: the ternary case (Q777417) (← links)
- On a theorem concerning partially overlapping subpalindromes of a binary word (Q2070082) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- Block reversal on finite words (Q2243589) (← links)
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
