Proof of a conjecture on word complexity
From MaRDI portal
Publication:5952902
zbMath0994.68103MaRDI QIDQ5952902
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)
Related Items (5)
Algorithms for subsequence combinatorics ⋮ Sublinear algorithms for approximating string compressibility ⋮ On average sequence complexity ⋮ On a conjecture about finite fixed points of morphisms ⋮ Total palindrome complexity of finite words
This page was built for publication: Proof of a conjecture on word complexity
