Closest substring problems for regular languages (Q5918147)
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 7318714
| 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 7318714 |
Statements
Closest substring problems for regular languages (English)
0 references
9 March 2021
0 references
closest substring problem
0 references
regular languages
0 references
finite automata
0 references
edit distance
0 references
computational complexity
0 references
0 references
0 references
0.9765312075614928
0 references
0.8550432920455933
0 references
0.8516948223114014
0 references
0.8056753873825073
0 references
0.7926907539367676
0 references
