Edit distance for pushdown automata
LNCS
Chatterjee, Krishnendu
Henzinger, Thomas A
Ibsen-Jensen, Rasmus
Otop, Jan
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.
Springer
2015
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
https://research-explorer.app.ist.ac.at/record/1610
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. 2015;9135(Part II):121-133. doi:<a href="https://doi.org/10.1007/978-3-662-47666-6_10">10.1007/978-3-662-47666-6_10</a>
eng
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-662-47666-6_10
info:eu-repo/grantAgreement/EC/FP7/267989
info:eu-repo/grantAgreement/FWF/Z211
info:eu-repo/grantAgreement/FWF/P 23499-N23
info:eu-repo/grantAgreement/FWF/S11407
info:eu-repo/grantAgreement/EC/FP7/279307
info:eu-repo/grantAgreement/FWF/S 11407_N23
info:eu-repo/semantics/closedAccess