Repetitive perhaps, but certainly not boring (Q1583539)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1521897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Repetitive perhaps, but certainly not boring |
scientific article; zbMATH DE number 1521897 |
Statements
Repetitive perhaps, but certainly not boring (English)
0 references
26 October 2000
0 references
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.
0 references
string
0 references
word
0 references
repetition
0 references
repeat
0 references
cover
0 references
0 references
0.7980245351791382
0 references
0.7818562388420105
0 references
0.7712833285331726
0 references
0.77055424451828
0 references
