Pages that link to "Item:Q5952902"
From MaRDI portal
The following pages link to Proof of a conjecture on word complexity (Q5952902):
Displaying 9 items.
- On a conjecture about finite fixed points of morphisms (Q557920) (← links)
- On average sequence complexity (Q703547) (← links)
- Total palindrome complexity of finite words (Q1045150) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
- Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
- On Turing's formula for word probabilities (Q3763460) (← links)