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

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

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 Nondetermini...

Full description

Bibliographic Details
Main Authors: Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang
Format: Article
Language:English
Published: MDPI AG 2018-10-01
Series:Algorithms
Subjects:
algorithms
automata
complexity
edit distance
implementation
transducers
regular language
Online Access:https://www.mdpi.com/1999-4893/11/11/165

Similar Items

Similar Items