Computing the \(\lambda \)-covers of a string (Q2384518)
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 5199288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the \(\lambda \)-covers of a string |
scientific article; zbMATH DE number 5199288 |
Statements
Computing the \(\lambda \)-covers of a string (English)
0 references
10 October 2007
0 references
\(\lambda \)-cover problem
0 references
\(\lambda \)-combinations
0 references
equivalence class
0 references
string regularities
0 references
general \(\lambda \)-cover problem
0 references
0 references
0.8650232553482056
0 references
0.8590580224990845
0 references
0.8371099829673767
0 references
0.8347784876823425
0 references
