Home
Scholarly Works
Repetitive perhaps, but certainly not boring
Conference

Repetitive perhaps, but certainly not boring

Abstract

In this paper some of the work done on repetitions in strings is surveyed, especially that of an algorithmic nature. Several open problems are described and conjectures formulated about some of them.

Authors

Smyth WF

Volume

249

Pagination

pp. 343-355

Publisher

Elsevier

Publication Date

October 28, 2000

DOI

10.1016/s0304-3975(00)00067-0

Conference proceedings

Theoretical Computer Science

Issue

2

ISSN

0304-3975

Contact the Experts team