A different proof of the Crochemore-Ilie lemma concerning microruns

zbMATH Open1216.68207MaRDI QIDQ3084791FDOQ3084791

Authors: Frantisek Franek, Jan Holub 

Publication date: 25 March 2011

Recommendations

• The number of runs in a string
• Asymptotic behavior of the numbers of runs and microruns
• Towards a Solution to the “Runs” Conjecture
• Not So Many Runs in Strings
• The ``runs conjecture

zbMATH Keywords

repetitionsCrochemore-Ilie lemmanumber of microrunsperiodicities in stringsR-cover

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cited In (3)

• A computational substantiation of the \(d\)-step approach to the number of distinct squares problem
• A computational framework for determining run-maximal strings
• On the structure of run-maximal strings

This page was built for publication: A different proof of the Crochemore-Ilie lemma concerning microruns

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