Counting maximal-exponent factors in words

Golnaz Badkobeh; Maxime Crochemore; Robert Mercaş

doi:10.1016/j.tcs.2016.02.035

Counting maximal-exponent factors in words

Golnaz Badkobeh, Maxime Crochemore, Robert Mercaş

Informatics

Research output: Contribution to journal › Article › peer-review

130 Downloads (Pure)

Abstract

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

Original language	English
Journal	Theoretical Computer Science
Early online date	2 Mar 2016
DOIs	https://doi.org/10.1016/j.tcs.2016.02.035
Publication status	E-pub ahead of print - 2 Mar 2016

Keywords

Combinatorics on words
Word exponent
Maximal-exponent factor

Access to Document

10.1016/j.tcs.2016.02.035

1-s2.0-S0304397516001778-mainAccepted author manuscript, 329 KB

http://www.sciencedirect.com/science/article/pii/S0304397516001778

Cite this

@article{a6b02fcac122468ab576efef22769b87,

title = "Counting maximal-exponent factors in words",

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

keywords = "Combinatorics on words, Word exponent, Maximal-exponent factor",

author = "Golnaz Badkobeh and Maxime Crochemore and Robert Merca{\c s}",

year = "2016",

month = mar,

day = "2",

doi = "10.1016/j.tcs.2016.02.035",

language = "English",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - Counting maximal-exponent factors in words

AU - Badkobeh, Golnaz

AU - Crochemore, Maxime

AU - Mercaş, Robert

PY - 2016/3/2

Y1 - 2016/3/2

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

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

KW - Combinatorics on words

KW - Word exponent

KW - Maximal-exponent factor

U2 - 10.1016/j.tcs.2016.02.035

DO - 10.1016/j.tcs.2016.02.035

M3 - Article

SN - 0304-3975

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Counting maximal-exponent factors in words

Abstract

Keywords

Access to Document

Fingerprint

Cite this