Exact bounds on the complexity of sequential string matching algorithms (Q1326953)
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: Exact bounds on the complexity of sequential string matching algorithms |
scientific article; zbMATH DE number 589786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact bounds on the complexity of sequential string matching algorithms |
scientific article; zbMATH DE number 589786 |
Statements
Exact bounds on the complexity of sequential string matching algorithms (English)
0 references
2 January 1995
0 references
string matching
0 references
string searching
0 references
text editing
0 references
computational complexity
0 references
worst case behavior
0 references
finite automata
0 references
0.9164939522743224
0 references
0.916473150253296
0 references
0.8827457427978516
0 references
0.8817896246910095
0 references
0.8681861758232117
0 references
