Geodesic
The similarity of two strings of fuzzy sets
Kybernetika, Tome 36 (2000) no. 6, p. [671]

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

Let ${\cal A},\,{\cal B}$ be the strings of fuzzy sets over ${\chi }$, where ${\chi }$ is a finite universe of discourse. We present the algorithms for operations on fuzzy sets and the polynomial time algorithms to find the string ${\cal C}$ over ${\chi }$ which is a closest common subsequence of fuzzy sets of ${\cal A}$ and ${\cal B}$ using different operations to measure a similarity of fuzzy sets.
Classification : 03E72, 68W32
Keywords: fuzzy set; polynomial-time algorithms 
@article{KYB_2000__36_6_a4,
     author = {Andrejkov\'a, Gabriela},
     title = {The similarity of two strings of fuzzy sets},
     journal = {Kybernetika},
     pages = {[671]},
     publisher = {mathdoc},
     volume = {36},
     number = {6},
     year = {2000},
     mrnumber = {1805814},
     zbl = {1249.03089},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2000__36_6_a4/}
}
TY  - JOUR
AU  - Andrejková, Gabriela
TI  - The similarity of two strings of fuzzy sets
JO  - Kybernetika
PY  - 2000
SP  - [671]
VL  - 36
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/KYB_2000__36_6_a4/
LA  - en
ID  - KYB_2000__36_6_a4
ER  - 
%0 Journal Article
%A Andrejková, Gabriela
%T The similarity of two strings of fuzzy sets
%J Kybernetika
%D 2000
%P [671]
%V 36
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/KYB_2000__36_6_a4/
%G en
%F KYB_2000__36_6_a4
Andrejková, Gabriela. The similarity of two strings of fuzzy sets. Kybernetika, Tome 36 (2000) no. 6, p. [671]. http://geodesic.mathdoc.fr/item/KYB_2000__36_6_a4/