Pages that link to "Item:Q5021104"
From MaRDI portal
The following pages link to Upper bound for palindromic and factor complexity of rich words (Q5021104):
Displaying 7 items.
- Palindromic rich words and run-length encodings (Q738876) (← links)
- Palindromic factorization of rich words (Q2143052) (← links)
- Prefix palindromic length of the Sierpinski word (Q2163982) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- A unique extension of rich words (Q2664948) (← links)
- On k-Abelian Palindromic Rich and Poor Words (Q2921983) (← links)
- Upper Bound for Palindromic and Factor Complexity of Rich Words (Q6307893) (← links)