Computing the edit-distance between a regular language and a context-free language

Authors:
Yo-Sub Han;Sang-Ki Ko;Kai Salomaa
Affiliations:
Department of Computer Science, Yonsei University, Korea;Department of Computer Science, Yonsei University, Korea;School of Computing, Queen's University, Canada
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 10
Cited 1

The String-to-String Correction Problem

Journal of the ACM (JACM)
Order-n correction for regular languages

Communications of the ACM
Programming Techniques: Regular expression search algorithm

Communications of the ACM
How hard is computing the edit distance?

Information and Computation
Theory of Computation: A Primer

Theory of Computation: A Primer
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Semiring frameworks and algorithms for shortest-distance problems

Journal of Automata, Languages and Combinatorics
Descriptional complexity of error/edit systems

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Computing the edit distance of a regular language

Information and Computation
Decidability and shortest strings in formal languages

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems

Approximate matching between a context-free grammar and a finite-state automaton

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

The edit-distance between two strings is the smallest number of operations required to transform one string into the other. The edit-distance problem for two languages is to find a pair of strings, each of which is from different language, with the minimum edit-distance. We consider the edit-distance problem for a regular language and a context-free language and present an efficient algorithm that finds an optimal alignment of two strings, each of which is from different language. Moreover, we design a faster algorithm for the edit-distance problem that only finds the minimum number of operations of the optimal alignment.