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

Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 16th International Conference, DLT 2012, Proceedings
Pages85-96
Number of pages12
DOIs
Publication statusPublished - 2012
Event16th International Conference on Developments in Language Theory, DLT 2012 - Taipei, Taiwan, Province of China
Duration: 2012 Aug 142012 Aug 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7410 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Conference on Developments in Language Theory, DLT 2012
CountryTaiwan, Province of China
CityTaipei
Period12/8/1412/8/17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computing the edit-distance between a regular language and a context-free language'. Together they form a unique fingerprint.

  • Cite this

    Han, Y. S., Ko, S. K., & Salomaa, K. (2012). Computing the edit-distance between a regular language and a context-free language. In Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings (pp. 85-96). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7410 LNCS). https://doi.org/10.1007/978-3-642-31653-1_9