{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:28:56Z","timestamp":1777645736897,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:p>A (combinatorial) channel consists of pairs of words representing all possible input-output channel situations. In a past paper, we formalized the intuitive concept of \u201clargest amount of errors\u201d detectable by a given language L, by defining the maximal error-detecting capabilities of L with respect to a given class of channels, and we showed how to compute all maximal error-detecting capabilities (channels) of a given regular language with respect to the class of rational channels and a class of channels involving only the substitution-error type. In this paper we resolve the problem for channels involving any combination of the basic error types: substitution, insertion, deletion. Moreover, we consider the problem of finding the inverses of these channels, in view of the fact that L is error-detecting for \u03b3 if and only if it is error-detecting for the inverse of \u03b3. We also discuss a natural method of reducing the problem of computing (inner) distances of a given regular language L to the problem of computing maximal error-detecting capabilities of L.<\/jats:p>","DOI":"10.3233\/fi-2010-287","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:11:06Z","timestamp":1575328266000},"page":"257-270","source":"Crossref","is-referenced-by-count":8,"title":["Computing Maximal Error-detecting Capabilities and Distances of Regular Languages"],"prefix":"10.1177","volume":"101","author":[{"given":"Stavros","family":"Konstantinidis","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computing Science, Saint Mary\u2019s University, Halifax, Nova Scotia, B3H 3C3 Canada. s.konstantinidis@smu.ca"}]},{"given":"Pedro V.","family":"Silva","sequence":"additional","affiliation":[{"name":"Centro de Matem\u00e1tica, Faculdade de Ci\u00eancias, Universidade do Porto \u2013 R. Campo Alegre 687, 4169-007 Porto, Portugal. pvsilva@fc.up.pt"}]}],"member":"179","published-online":{"date-parts":[[2010,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2010-287","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2010-287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:33:09Z","timestamp":1777444389000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2010-287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["10.3233\/FI-2010-287"],"URL":"https:\/\/doi.org\/10.3233\/fi-2010-287","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,1]]}}}