Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
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.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 417-430 |
Число страниц | 14 |
Журнал | Theoretical Computer Science |
Том | 777 |
DOI | |
Состояние | Опубликовано - 19 июл 2019 |
ID: 43676311