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 Jan 1
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

Fingerprint

Context free languages
Edit Distance
Context-free Languages
Personal digital assistants
Polynomials
Complementation
Language
Polynomial time
Alignment
Intersection
Closed
Integer
Computing

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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
Han, Yo-Sub ; Ko, Sang Ki. / Edit-distance between visibly pushdown languages. SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. editor / Christel Baier ; Mark van den Brand ; Johann Eder ; Mike Hinchey ; Tiziana Margaria ; Bernhard Steffen. Springer Verlag, 2017. pp. 387-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fff1b597be47422cbf1850f5db5e32e5,
title = "Edit-distance between visibly pushdown languages",
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.",
author = "Yo-Sub Han and Ko, {Sang Ki}",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-51963-0_30",
language = "English",
isbn = "9783319519623",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "387--401",
editor = "Christel Baier and {van den Brand}, Mark and Johann Eder and Mike Hinchey and Tiziana Margaria and Bernhard Steffen",
booktitle = "SOFSEM 2017",
address = "Germany",

}

Han, Y-S & Ko, SK 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10139 LNCS, Springer Verlag, pp. 387-401, 43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, Limerick, Ireland, 17/1/16. https://doi.org/10.1007/978-3-319-51963-0_30

Edit-distance between visibly pushdown languages. / Han, Yo-Sub; Ko, Sang Ki.

SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. ed. / Christel Baier; Mark van den Brand; Johann Eder; Mike Hinchey; Tiziana Margaria; Bernhard Steffen. Springer Verlag, 2017. p. 387-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10139 LNCS).

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

TY - GEN

T1 - Edit-distance between visibly pushdown languages

AU - Han, Yo-Sub

AU - Ko, Sang Ki

PY - 2017/1/1

Y1 - 2017/1/1

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

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

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

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

U2 - 10.1007/978-3-319-51963-0_30

DO - 10.1007/978-3-319-51963-0_30

M3 - Conference contribution

AN - SCOPUS:85010653608

SN - 9783319519623

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

SP - 387

EP - 401

BT - SOFSEM 2017

A2 - Baier, Christel

A2 - van den Brand, Mark

A2 - Eder, Johann

A2 - Hinchey, Mike

A2 - Margaria, Tiziana

A2 - Steffen, Bernhard

PB - Springer Verlag

ER -

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