6 citations · 6 across the 1 of their papers we have counts for
1 paper
Lila Kari, Stavros Konstantinidis, Steffen Kopecki +1
We revisit the problem of computing the edit distance of a regular language given via an NFA. This problem relates to the inherent maximal error-detecting capability of the languag…