Closest substring problems for regular languages (Q5918147)
From MaRDI portal
scientific article; zbMATH DE number 7318714
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
