Repetitive perhaps, but certainly not boring
Smyth, W.F. (2000) Repetitive perhaps, but certainly not boring. Theoretical Computer Science, 249 (2). pp. 343-355.
*Subscription may be required
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|
|Item Control Page|