Conference paper
Repetitive perhaps, but certainly not boring
9th Australasian Workshop on Combinatorial Algorithms (AWOCA '98) (Perth, Western Australia, 27/07/1998–30/07/1998)
1998
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.
Details
- Title
- Repetitive perhaps, but certainly not boring
- Authors/Creators
- W.F. Smyth (Author/Creator)
- Conference
- 9th Australasian Workshop on Combinatorial Algorithms (AWOCA '98) (Perth, Western Australia, 27/07/1998–30/07/1998)
- Identifiers
- 991005544374607891
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Conference paper
Metrics
123 File views/ downloads
60 Record Views