Catalog Home Page

Repetitive perhaps, but certainly not boring

Smyth, W.F. (2000) Repetitive perhaps, but certainly not boring. Theoretical Computer Science, 249 (2). pp. 343-355.

Link to Published Version: http://dx.doi.org/10.1016/S0304-3975(00)00067-0
*Subscription may be required

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.

Publication Type: Journal Article
Publisher: Elsevier BV
URI: http://researchrepository.murdoch.edu.au/id/eprint/27565
Item Control Page Item Control Page