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 Aug 20
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

Fingerprint

Context free languages
Context-free Languages
Edit Distance
Formal languages
Regular Languages
Strings
Computing
Alignment
Minimum Distance
Fast Algorithm
Efficient Algorithms
Transform
Language

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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
Han, Yo Sub ; Ko, Sang Ki ; Salomaa, Kai. / Computing the edit-distance between a regular language and a context-free language. Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. 2012. pp. 85-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ff754f1ac64a4e838d4b76f24d57b5bb,
title = "Computing the edit-distance between a regular language and a context-free language",
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.",
author = "Han, {Yo Sub} and Ko, {Sang Ki} and Kai Salomaa",
year = "2012",
month = "8",
day = "20",
doi = "10.1007/978-3-642-31653-1_9",
language = "English",
isbn = "9783642316524",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "85--96",
booktitle = "Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings",

}

Han, YS, Ko, SK & 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7410 LNCS, pp. 85-96, 16th International Conference on Developments in Language Theory, DLT 2012, Taipei, Taiwan, Province of China, 12/8/14. https://doi.org/10.1007/978-3-642-31653-1_9

Computing the edit-distance between a regular language and a context-free language. / Han, Yo Sub; Ko, Sang Ki; Salomaa, Kai.

Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. 2012. p. 85-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7410 LNCS).

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

TY - GEN

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

AU - Han, Yo Sub

AU - Ko, Sang Ki

AU - Salomaa, Kai

PY - 2012/8/20

Y1 - 2012/8/20

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

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

UR - http://www.scopus.com/inward/record.url?scp=84865039678&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865039678&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31653-1_9

DO - 10.1007/978-3-642-31653-1_9

M3 - Conference contribution

AN - SCOPUS:84865039678

SN - 9783642316524

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 85

EP - 96

BT - Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings

ER -

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