The similarity of two strings of fuzzy sets
Gabriela Andrejková · Czech digital mathematics library · 2000
summary: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.