… weighted automata algorithms over the appropriate semirings can be used to compute the
editdistance of two weighted automata … and e-removal of weighted transducers and a new and …

… Thus, we introduce the definition of the edit-distance of two distributions of strings given
by two weighted automata. We show that general weighted automata algorithms over the …

… We study edit distances between strings, based on weighted operations such as character
… that such edit distances are not computable in general, and propose weighted automata …

… This chapter presents several fundamental algorithms for weighted automata and transducers.
While the mathematical counterparts of weighted transducers, rational power series, have …

… study of edit distances from untimed languages to the timed setting. We define an edit distance
… While computing the edit distance between two timed automata is undecidable, we show …

… The approximate string searching problem is to find all approximate matches of p in t having
weighted edit distance at most k from p. We present a new method that preprocesses the …

… the edit distance computation problem between two automata A1 and A2, where A1 and
A2 can be (non-)deterministic finite automata or pushdown automata. … of weighted edit-distance, …

… languages and finite automata of edit strings as tools for reasoning about the distance of a
… to only those permitted by the weighted automaton. We note that, for the case of the plain …

… 4 we introduce the notion of weighted edit distance. In Sect. 5 we propose a novel approach
for computing, using the weighted edit distance, the robustness degree of a discrete signal …

… edit distance apply to this weighted variant. We then generalize our result to the weighted
tree and Dyck edit distances, … ments even for the unweighted tree edit distance problem: As a …