---
res:
  bibo_abstract:
  - The edit distance between two words w1, w2 is the minimal number of word operations
    (letter insertions, deletions, and substitutions) necessary to transform w1 to
    w2. The edit distance generalizes to languages L1,L2, where the edit distance
    is the minimal number k such that for every word from L1 there exists a word in
    L2 with edit distance at most k. We study the edit distance computation problem
    between pushdown automata and their subclasses. The problem of computing edit
    distance to pushdown automata is undecidable, and in practice, the interesting
    question is to compute the edit distance from a pushdown automaton (the implementation,
    a standard model for programs with recursion) to a regular language (the specification).
    In this work, we present a complete picture of decidability and complexity for
    deciding whether, for a given threshold k, the edit distance from a pushdown automaton
    to a finite automaton is at most k.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  - foaf_Person:
      foaf_givenName: Rasmus
      foaf_name: Ibsen-Jensen, Rasmus
      foaf_surname: Ibsen-Jensen
      foaf_workInfoHomepage: http://www.librecat.org/personId=3B699956-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0003-4783-0389
  - foaf_Person:
      foaf_givenName: Jan
      foaf_name: Otop, Jan
      foaf_surname: Otop
      foaf_workInfoHomepage: http://www.librecat.org/personId=2FC5DA74-F248-11E8-B48F-1D18A9856A87
  bibo_doi: 10.1007/978-3-662-47666-6_10
  bibo_issue: Part II
  bibo_volume: 9135
  dct_date: 2015^xs_gYear
  dct_identifier:
  - UT:000364317900010
  dct_isPartOf:
  - http://id.crossref.org/issn/978-3-662-47665-9
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Edit distance for pushdown automata@
...
