Edit distance for pushdown automata

K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).

Download
OA 279.07 KB
OA IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf 279.07 KB

Journal Article | Published | English
Abstract
The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 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 a pushdown automaton 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 the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite.
Publishing Year
Date Published
2017-09-13
Journal Title
Logical Methods in Computer Science
Volume
13
Issue
3
ISSN
IST-REx-ID

Cite this

Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:23)2017
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science 13, no. 3 (2017). https://doi.org/10.23638/LMCS-13(3:23)2017.
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.
All files available under the following license(s):
Creative Commons License:
CC-BY-NDCreative Commons Attribution-NoDerivates (CC BY-ND 4.0)
Main File(s)
File Name
Access Level
OA Open Access
Last Uploaded
2018-12-12T10:14:37Z
Access Level
OA Open Access
Last Uploaded
2018-12-12T10:14:38Z


Material in IST:
Earlier Version
Earlier Version

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar