Edit-distance between visibly pushdown languages

Yo Sub Han, Sang Ki Ko

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

3 Citations (Scopus)

Abstract

We study the edit-distance between two visibly pushdown languages. It is well-known that the edit-distance between two context-free languages is undecidable. The class of visibly pushdown languages is a robust subclass of context-free languages since it is closed under intersection and complementation whereas context-free languages are not. We show that the edit-distance problem is decidable for visibly pushdown languages and present an algorithm for computing the edit-distance based on the construction of an alignment PDA. Moreover, we show that the edit-distance can be computed in polynomial time if we assume that the edit-distance is bounded by a fixed integer k.

Original languageEnglish
Title of host publicationSOFSEM 2017
Subtitle of host publicationTheory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
EditorsChristel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria, Bernhard Steffen
PublisherSpringer Verlag
Pages387-401
Number of pages15
ISBN (Print)9783319519623
DOIs
Publication statusPublished - 2017
Event43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017 - Limerick, Ireland
Duration: 2017 Jan 162017 Jan 20

Publication series

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

Other

Other43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017
CountryIreland
CityLimerick
Period17/1/1617/1/20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Edit-distance between visibly pushdown languages'. Together they form a unique fingerprint.

  • Cite this

    Han, Y. S., & Ko, S. K. (2017). Edit-distance between visibly pushdown languages. In C. Baier, M. van den Brand, J. Eder, M. Hinchey, T. Margaria, & B. Steffen (Eds.), SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 387-401). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10139 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-51963-0_30