Mostrar el registro sencillo del ítem

dc.contributor.authorDassow, Jürgen
dc.contributor.authorMartín Reyes, Gema María
dc.contributor.authorVico-Vela, Francisco Jose 
dc.date.accessioned2013-12-04T12:20:56Z
dc.date.available2013-12-04T12:20:56Z
dc.date.issued2009
dc.identifier.citationDassow J, Martin GM & Vico FJ (2009) A similarity measure for cyclic unary regular languages. Fundamenta Informaticae, 96(1-2):71-88.es_ES
dc.identifier.otherDOI:10.3233/FI-2009-168
dc.identifier.urihttp://hdl.handle.net/10630/6733
dc.description.abstractA cyclic unary regular language is a regular language over a unary alphabet that is represented by a cyclic automaton. We propose a similarity measure for cyclic unary regular languages by modifying the Jaccard similarity coe cient and the So rensen coe cient to measure the level of overlap between such languages. This measure computes the proportion of strings that are shared by two or more cyclic unary regular languages and is an upper bound of the Jaccard coe cient and the S orensen coe cient. By using such similarity measure, we de ne a dissimilarity measure for cyclic unary regular languages that is a semimetric distance. Moreover, it can be used for the non-cyclic case.es_ES
dc.language.isoenges_ES
dc.publisherIOS Presses_ES
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectMatemáticas computacionaleses_ES
dc.subject.otherSimilarity measurees_ES
dc.subject.otherCyclic unary regular languagees_ES
dc.subject.otherJaccard coees_ES
dc.subject.otherSorensen coefficientes_ES
dc.titleA similarity measure for cyclic unary regular languageses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.centroE.T.S.I. Informáticaes_ES


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem