27 search results - page 1 / 6 » Computing the edit distance of a regular language |
IANDC
2007
13 years 4 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
FUIN
2010
13 years 3 months ago
2010
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
TCS
2008
13 years 3 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
JUCS
2002
13 years 4 months ago
2002
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...