### Abstract

Edit distance ℓ-neighbourhood of a formal language is the set of all strings that can be transformed to one of the strings in this language by at most ℓ insertions and deletions. Both the regular and the context-free languages are known to be closed under this operation, whereas the family recognized by deterministic pushdown automata is not. This paper establishes the closure of the family recognized by input-driven pushdown automata (IDPDA), also known as visibly pushdown automata, under the edit distance neighbourhood operation. For an n-state nondeterministic IDPDA with n stack symbols, an automaton for its edit distance ℓ-neighbourhood using O(n^{ℓ+1}) states is constructed, and an asymptotically matching lower bound is established. For an n-state deterministic IDPDA, its 1-neighbourhood in the worst case requires a deterministic IDPDA with at least 2^{Ω(n2)} states.

Original language | English |
---|---|

Pages (from-to) | 417-430 |

Number of pages | 14 |

Journal | Theoretical Computer Science |

Volume | 777 |

DOIs | |

Publication status | Published - 19 Jul 2019 |

### Fingerprint

### Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*,

*777*, 417-430. https://doi.org/10.1016/j.tcs.2019.03.005