An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098)
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: An efficient algorithm to test square-freeness of strings compressed by straight-line programs |
scientific article; zbMATH DE number 6098072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to test square-freeness of strings compressed by straight-line programs |
scientific article; zbMATH DE number 6098072 |
Statements
An efficient algorithm to test square-freeness of strings compressed by straight-line programs (English)
0 references
23 October 2012
0 references
string algorithms
0 references
string processing
0 references
repetitions in strings
0 references
text compression
0 references
straight-line programs
0 references
0 references
0 references
0 references
0.934885025024414
0 references
0.8113494515419006
0 references
0.7846565246582031
0 references
0.7845391631126404
0 references
