Next Article in Journal
High-Gain Observer-Based Sliding-Mode Dynamic Surface Control for Particleboard Glue Mixing and Dosing System
Previous Article in Journal
Learning Representations of Natural Language Texts with Generative Adversarial Networks at Document, Sentence, and Aspect Level
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(11), 165; https://doi.org/10.3390/a11110165

Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers

1
School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada
2
Department of Mathematics and Computing Science, Saint Mary’s University, Halifax, NS B3H 3C3, Canada
3
Department of Computer Science, University of Western Ontario, London, ON N6A 5B7, Canada
*
Author to whom correspondence should be addressed.
Received: 6 October 2018 / Revised: 16 October 2018 / Accepted: 18 October 2018 / Published: 23 October 2018
(This article belongs to the Special Issue String Matching and Its Applications)
Full-Text   |   PDF [353 KB, uploaded 23 October 2018]   |  

Abstract

The concept of edit distance and its variants has applications in many areas such as computational linguistics, bioinformatics, and synchronization error detection in data communications. Here, we revisit the problem of computing the inner edit distance of a regular language given via a Nondeterministic Finite Automaton (NFA). This problem relates to the inherent maximal error-detecting capability of the language in question. We present two efficient algorithms for solving this problem, both of which execute in time O ( r 2 n 2 d ) , where r is the cardinality of the alphabet involved, n is the number of transitions in the given NFA, and d is the computed edit distance. We have implemented one of the two algorithms and present here a set of performance tests. The correctness of the algorithms is based on the connection between word distances and error detection and the fact that nondeterministic transducers can be used to represent the errors (resp., edit operations) involved in error-detection (resp., in word distances). View Full-Text
Keywords: algorithms; automata; complexity; edit distance; implementation; transducers; regular language algorithms; automata; complexity; edit distance; implementation; transducers; regular language
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Kari, L.; Konstantinidis, S.; Kopecki, S.; Yang, M. Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers. Algorithms 2018, 11, 165.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top