Efficiency and Penalty Factors on Monoids of Strings
Mitrofan M. Choban, Ivan Budanaev · DOAJ (DOAJ: Directory of Open Access Journals) · 2018
In information theory, linguistics and computer science, metrics for measuring similarity between two given strings (sequences) are important. In this article we introduce efficiency, measure of similarity and penalty for given parallel decompositions of two strings. Relations between these characteristics are established. In this way, we continue the research from \cite{CB1, CB2}.