The relative edit-distance between two input-driven languages

Hyunjoon Cheon, Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

We study the relative edit-distance problem between two input-driven languages. The relative edit-distance is closely related to the language inclusion problem, which is a crucial problem in formal verification. Input-driven languages are a robust subclass of context-free languages that enable to model program analysis questions within tractable time complexity. For instance, the language inclusion (or equivalence) problem is undecidable for context-free languages whereas the problem is solvable in polynomial time for input-driven languages specified by deterministic input-driven pushdown automata (IDPDAs) and is EXPTIME-complete for nondeterministic IDPDAs. Our main contribution is to prove that the relative edit-distance problem for two input-driven languages is decidable by designing a polynomial time IDPDA construction, based on the edit-distance, that recognizes a neighbourhood of a given input-driven language. In fact, the relative edit-distance problem between two input-driven languages turns out to be EXPTIME-complete when the neighbourhood distance threshold is fixed as a constant.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 23rd International Conference, DLT 2019, Proceedings
EditorsPiotrek Hofman, Michał Skrzypczak
PublisherSpringer Verlag
Pages127-139
Number of pages13
ISBN (Print)9783030248857
DOIs
StatePublished - 2019
Event23rd International Conference on Developments in Language Theory, DLT 2019 - Warsaw, Poland
Duration: 5 Aug 20199 Aug 2019

Publication series

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

Conference

Conference23rd International Conference on Developments in Language Theory, DLT 2019
Country/TerritoryPoland
CityWarsaw
Period5/08/199/08/19

Keywords

  • Algorithm
  • Complexity
  • Decidability
  • Edit-distance
  • Input-driven languages
  • Visibly pushdown languages

Fingerprint

Dive into the research topics of 'The relative edit-distance between two input-driven languages'. Together they form a unique fingerprint.

Cite this