| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952286 | Theoretical Computer Science | 2017 | 9 Pages |
Abstract
This article shows tight upper and lower bounds on the number of occurrences of maximal-exponent factors occurring in a word.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Golnaz Badkobeh, Maxime Crochemore, Robert MercaÅ,