RT Journal Article
T1 A similarity measure for cyclic unary regular languages
A1 Dassow, Jürgen
A1 Martín Reyes, Gema María
A1 Vico-Vela, Francisco José
K1 Matemáticas computacionales
AB A cyclic unary regular language is a regular language over a unary alphabet that is representedby a cyclic automaton. We propose a similarity measure for cyclic unary regularlanguages by modifying the Jaccard similarity coe cient and the So rensen coe cient tomeasure the level of overlap between such languages. This measure computes the proportionof strings that are shared by two or more cyclic unary regular languages and isan upper bound of the Jaccard coe cient and the S orensen coe cient. By using suchsimilarity measure, we de ne a dissimilarity measure for cyclic unary regular languagesthat is a semimetric distance. Moreover, it can be used for the non-cyclic case.
PB IOS Press
YR 2009
FD 2009
LK http://hdl.handle.net/10630/6733
UL http://hdl.handle.net/10630/6733
LA eng
NO Dassow J, Martin GM & Vico FJ (2009) A similarity measure for cyclic unary regular languages. Fundamenta Informaticae, 96(1-2):71-88.
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 26 ene 2026