Infinite binary words containing repetitions of odd period

Badkobeh, Golnaz and Crochemore, Maxime. 2015. Infinite binary words containing repetitions of odd period. Information Processing Letters, 115(5), pp. 543-547. ISSN 0020-0190 [Article]

[img]
Preview
Text
Badkobeh, G. (2015) Infinite binary words containing repetitions of odd period_AAM.pdf - Submitted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (197kB) | Preview

Abstract or Description

A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is its length divided by its smallest period. In this article, we give some new results on the trade-off between the number of squares and the number of cubes in infinite binary words whose square factors have odd periods.

Item Type:

Article

Identification Number (DOI):

https://doi.org/10.1016/j.ipl.2015.01.004

Keywords:

Combinatorial problems, Combinatorics on words, Repetitions, Repetitive threshold, Word morphisms

Departments, Centres and Research Units:

Computing

Dates:

DateEvent
17 January 2015Accepted
22 January 2015Published Online

Item ID:

29109

Date Deposited:

30 Jul 2020 14:11

Last Modified:

08 Aug 2020 17:16

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI:

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

View statistics for this item...

Edit Record Edit Record (login required)