Research Online

Logo

Goldsmiths - University of London

Counting Maximal-Exponent Factors in Words

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

No full text available
[img] Text
MaxExp_TCS17.pdf - Accepted Version
Permissions: Administrator Access Only until 1 January 2019.
Available under License Creative Commons Attribution.

Download (380kB)

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:

DateEvent
25 February 2016Accepted
1 January 2018Published

Item ID:

23335

Date Deposited:

17 May 2018 11:45

Last Modified:

15 Jul 2018 04:27

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI:

http://research.gold.ac.uk/id/eprint/23335

View statistics for this item...

Edit Record Edit Record (login required)