Article thumbnail

Repetitive perhaps, but certainly not boring

By W.F. Smyth


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

Year: 1998
OAI identifier:
Provided by: Research Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://researchrepository.mur... (external link)
  • https://researchrepository.mur... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.