Edit Distance Neighbourhoods of Input-Driven Pushdown Automata
Edit distance \(\ell \)-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 \(\ell \) insertions and deletions. Both the regular and the context-free languages are known to be closed under this operation, whereas the deterministic pushdown automata are not. This paper establishes the closure of the family of input-driven pushdown automata (IDPDA), also known as visibly pushdown automata, under the edit distance neighbourhood operation. A construction of automata representing the result of the operation is given, and close lower bounds on the size of any such automata are presented.
- 2.Alur, R., Madhusudan, P.: Visibly pushdown languages. In: ACM Symposium on Theory of Computing, STOC 2004, Chicago, USA 13–16 June 2004, pp. 202–211 (2004). http://dx.doi.org/10.1145/1007352.1007390
- 3.Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009). http://dx.doi.org/10.1145/1516512.1516518
- 20.Povarov, G.: Descriptive complexity of the Hamming neighborhood of a regular language. In: LATA 2007, pp. 509–520 (2007)Google Scholar