Repetitive perhaps, but certainly not boring
Smyth, W.F. (1998) Repetitive perhaps, but certainly not boring. In: 9th Australasian Workshop on Combinatorial Algorithms (AWOCA '98), 27 - 30 July 1998, Perth, Western Australia
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:||Conference Paper|
|Item Control Page|
Downloads per month over past year