Proof of a conjecture on word complexity
From MaRDI portal
Publication:5952902
zbMATH Open0994.68103MaRDI QIDQ5952902FDOQ5952902
Authors: Florence Levé, Patrice Séébold 
Publication date: 14 January 2002
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
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 (9)
- On a conjecture about finite fixed points of morphisms
- The complexity of computing maximal word functions
- Sublinear algorithms for approximating string compressibility
- Algorithms for subsequence combinatorics
- Automatic Theorem-Proving in Combinatorics on Words
- Complexity results on restricted instances of a paint shop problem for words
- On Turing's formula for word probabilities
- On average sequence complexity
- Total palindrome complexity of finite words
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)
