Streaming Property Testing of Visibly Pushdown Languages
Nathana\"el Fran\c{c}ois, Fr\'ed\'eric Magniez, Michel de, Rougemont, Olivier Serre

TL;DR
This paper introduces a streaming property tester for visibly pushdown languages that uses minimal memory, outperforming traditional streaming algorithms and property testers in recognizing complex language properties.
Contribution
It presents the first streaming property tester for VPL with polylogarithmic memory, combining automata simulation and novel suffix-sampling techniques.
Findings
Memory-efficient streaming tester for VPL
Application to hard instances of VPL
Introduction of suffix-sampling method
Abstract
In the context of language recognition, we demonstrate the superiority of streaming property testers against streaming algorithms and property testers, when they are not combined. Initiated by Feigenbaum et al., a streaming property tester is a streaming algorithm recognizing a language under the property testing approximation: it must distinguish inputs of the language from those that are -far from it, while using the smallest possible memory (rather than limiting its number of input queries). Our main result is a streaming -property tester for visibly pushdown languages (VPL) with one-sided error using memory space . This constructions relies on a (non-streaming) property tester for weighted regular languages based on a previous tester by Alon et al. We provide a simple application of this tester for streaming…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Machine Learning and Algorithms · Advanced Database Systems and Queries
