Property testing of regular languages with applications to streaming property testing of visibly pushdown languages
Résumé
In this work, we revisit the problem of testing membership in regular languages, first studied by Alon et al. [1]. We develop a one-sided error property tester for regular languages under weighted edit distance that makes O((1/ε) log(1/ε)) non-adaptive queries, assuming that the language is described by an automaton of constant size. Moreover, we show a matching lower bound, essentially closing the problem for the edit distance. As an application, we improve the space bound of the current best streaming property testing algorithm for visibly pushdown languages from O((1/ε)^4 log^6 n) to O((1/ε)^3 log^5 n log log n), where n is the size of the input. Finally, we provide aΩ(max((1/ε) , log n)) lower bound on the memory necessary to test visibly pushdown languages in the streaming model, significantly narrowing the gap between the known bounds.
Origine : Fichiers éditeurs autorisés sur une archive ouverte