| Articolul precedent |
| Articolul urmator |
 |
 598 0 |
 SM ISO690:2012CHOBAN, Mitrofan, BUDANAEV, Ivan. Distances on Monoids of Strings and Their Applications. In: Conference on Mathematical Foundations of Informatics, Ed. 2016, 25-30 iulie 2016, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2016, pp. 144-159. ISBN 978‐9975‐4237‐4‐8. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conference on Mathematical Foundations of Informatics 2016 | ||||||
|
Conferința "Conference on Mathematical Foundations of Informatics" 2016, Chișinău, Moldova, 25-30 iulie 2016 | ||||||
|
||||||
| Pag. 144-159 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In this article it is proved that for any quasimetric d on alphabet A there exists a maximal invariant extension __ on the free monoid L(A) of all strings. If d is a discrete metric, then the metric __ allows for a special decomposition of two strings, which is important in solving the approximate string matching problem. |
||||||
| Cuvinte-cheie free monoid, invariant distance, quasimetric, Hamming distance, Levenshtein distance |
||||||
|
|
|
|
