“…One of the most classical and well-understood string-problems is computing the edit distance between words [44], for which an optimal (up to poly-logarithmic factors) solution exists [1,47]. The problem of computing the edit distance between a word and a language, or between two languages, is also a well-studied problem, in various settings (see, e.g., [6,9,10,28,33]).…”