Information Retrieval
Handbook of Formal Languages
Optimal Simulations between Unary Automata
SIAM Journal on Computing
Errata to: "finite automata and unary languages"
Theoretical Computer Science
Complementing unary nondeterministic automata
Theoretical Computer Science - Descriptional complexity of formal systems
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
IEEE Transactions on Information Theory
Low Disruption Transformations on Cyclic Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
| Hi-index | 0.00 |
A 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 coefficient and the Sørensen coefficient 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 coefficient and the Sørensen coefficient. By using such similarity measure, we define a dissimilarity measure for cyclic unary regular languages that is a semimetric distance. Moreover, it can be used for the non-cyclic case.