{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:36Z","timestamp":1753889856390,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T00:00:00Z","timestamp":1505260800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T00:00:00Z","timestamp":1505260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T00:00:00Z","timestamp":1505260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["267989"],"award-info":[{"award-number":["267989"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["279307"],"award-info":[{"award-number":["279307"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["P 23499"],"award-info":[{"award-number":["P 23499"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>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 $\\mathcal{L}_1, \\mathcal{L}_2$, where the edit distance from $\\mathcal{L}_1$ to $\\mathcal{L}_2$ is the minimal number $k$ such that for every word from $\\mathcal{L}_1$ there exists a word in $\\mathcal{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.<\/jats:p><jats:p>Comment: An extended version of a paper accepted to ICALP 2015 with the same   title. The paper has been accepted to the LMCS journal<\/jats:p>","DOI":"10.23638\/lmcs-13(3:23)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:33:59Z","timestamp":1743701639000},"source":"Crossref","is-referenced-by-count":0,"title":["Edit Distance for Pushdown Automata"],"prefix":"10.23638","volume":"Volume 13, Issue 3","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4783-0389","authenticated-orcid":false,"given":"Rasmus","family":"Ibsen-Jensen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8804-8011","authenticated-orcid":false,"given":"Jan","family":"Otop","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,9,13]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1504.08259v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1504.08259v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:33:59Z","timestamp":1743701639000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,13]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(3:23)2017","relation":{"is-same-as":[{"id-type":"arxiv","id":"1504.08259","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1504.08259","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,9,13]]},"article-number":"3927"}}