### 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 language | English |
---|---|

Title of host publication | Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings |

Pages | 85-96 |

Number of pages | 12 |

DOIs | |

Publication status | Published - 2012 |

Event | 16th International Conference on Developments in Language Theory, DLT 2012 - Taipei, Taiwan, Province of China Duration: 2012 Aug 14 → 2012 Aug 17 |

### Publication series

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

Volume | 7410 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 16th International Conference on Developments in Language Theory, DLT 2012 |
---|---|

Country | Taiwan, Province of China |

City | Taipei |

Period | 12/8/14 → 12/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

*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