A work-time optimal algorithm for computing all string covers (Q671438)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A work-time optimal algorithm for computing all string covers |
scientific article; zbMATH DE number 983302
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A work-time optimal algorithm for computing all string covers |
scientific article; zbMATH DE number 983302 |
Statements
A work-time optimal algorithm for computing all string covers (English)
0 references
27 February 1997
0 references
repetitive structures of strings
0 references
0 references
