Sciweavers

Share
27 search results - page 1 / 6
» Computing the edit distance of a regular language
Sort
View
IANDC
2007
117views more  IANDC 2007»
10 years 2 months ago
Computing the edit distance of a regular language
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...
Stavros Konstantinidis
ICALP
2004
Springer
10 years 8 months ago
Property Testing of Regular Tree Languages
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...
Frédéric Magniez, Michel de Rougemon...
FUIN
2010
89views more  FUIN 2010»
10 years 1 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
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 “...
Stavros Konstantinidis, Pedro V. Silva
TCS
2008
10 years 2 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
JUCS
2002
106views more  JUCS 2002»
10 years 2 months ago
Additive Distances and Quasi-Distances Between Words
: 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...
Cristian Calude, Kai Salomaa, Sheng Yu
books