Badkobeh, Golnaz; Crochemore, Maxime and Mercas, Robert. 2017. Counting Maximal-Exponent Factors in Words. Theoretical Computer Science, 658(A), pp. 27-35. ISSN 0304-3975 [Article]

Preview

Text MaxExp_TCS17.pdf - Accepted Version Available under License Creative Commons Attribution. Download (380kB) | Preview

Abstract or Description

This article shows tight upper and lower bounds on the number of occurrences of maximal-exponent factors occurring in a word.

Item Type:	Article
Identification Number (DOI):	https://doi.org/10.1016/j.tcs.2016.02.035
Keywords:	combinatorics on words, word exponent, maximal-exponent factor
Departments, Centres and Research Units:	Computing
Dates:	Date Event 25 February 2016 Accepted 7 January 2017 Published 2 March 2016 Published Online
Item ID:	23335
Date Deposited:	17 May 2018 11:45
Last Modified:	19 Mar 2021 12:13
Peer Reviewed:	Yes, this version has been peer-reviewed.
URI:	https://research.gold.ac.uk/id/eprint/23335

View statistics for this item...

Edit Record (login required)