Proof of a conjecture on word complexity
From MaRDI portal
Recommendations
- Some bounds on the complexity of words
- scientific article; zbMATH DE number 3892611
- scientific article; zbMATH DE number 4085051
- A characterization of words of linear complexity
- scientific article; zbMATH DE number 1992419
- Properties of the complexity function for finite words
- Proof of Rueppel's linear complexity conjecture (Corresp.)
- The complexity of computing maximal word functions
- scientific article; zbMATH DE number 1834659
- On the minimal complexity of infinite words
Cited in
(12)- Total palindrome complexity of finite words
- The complexity of computing maximal word functions
- Algorithms for subsequence combinatorics
- Sublinear algorithms for approximating string compressibility
- Complexity results on restricted instances of a paint shop problem for words
- Automatic Theorem-Proving in Combinatorics on Words
- On Turing's formula for word probabilities
- On a conjecture about finite fixed points of morphisms
- A symmetry property of Christoffel words
- A symmetry property of Christoffel words
- On average sequence complexity
- Combinatorics on finite words and the length of a finite-dimensional associative algebra
This page was built for publication: Proof of a conjecture on word complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952902)
