Closest substring problems for regular languages (Q5915558)
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 6983394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Closest substring problems for regular languages |
scientific article; zbMATH DE number 6983394 |
Statements
Closest substring problems for regular languages (English)
0 references
22 November 2018
0 references
closest substring problem
0 references
computational complexity
0 references
regular languages
0 references
edit distance
0 references
0.9765312075614928
0 references
0.8784733414649963
0 references
0.8632336258888245
0 references
0.8060849905014038
0 references
0.7882940769195557
0 references
