On an efficient method for estimating the number of nonrepeating words

MaRDI QIDQ3115630zbMATH OpenFDO

Authors Roman Kolpakov

Publication date 10 February 2012

zbMATH Keywords

square subwordsquare-free word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Efficient lower bounds on the number of repetition-free words
• On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
• Bounds for the generalized repetition threshold
• On the Repetition Threshold for Large Alphabets
• Some results on the number of periodic factors in words

Cited in

(3)

• A novel statistical measure for sequence comparison on the basis of \(k\)-word counts
• Efficient lower bounds on the number of repetition-free words
• scientific article; zbMATH DE number 6933706 (Why is no real title available?)

This page was built for publication: On an efficient method for estimating the number of nonrepeating words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115630)