Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers
School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada
Department of Mathematics and Computing Science, Saint Mary’s University, Halifax, NS B3H 3C3, Canada
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
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
, 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).
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).
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.
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(11):165.
Kari, Lila; Konstantinidis, Stavros; Kopecki, Steffen; Yang, Meng. 2018. "Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers." Algorithms 11, no. 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.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.