The trichotomy of regular property testing
From MaRDI portal
Cites work
- A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
- A new approach for testing properties of discrete distributions
- Dynamic membership for regular languages
- Efficient testing of large graphs
- Every Monotone Graph Property Is Testable
- Handbook of automata theory. Volume II. Automata in mathematics and selected applications
- scientific article; zbMATH DE number 1418269 (Why is no real title available?)
- scientific article; zbMATH DE number 7650239 (Why is no real title available?)
- Improved bounds for testing Dyck languages
- Introduction to Property Testing
- Property testing and its connection to learning and approximation
- Property testing of regular languages with applications to streaming property testing of visibly pushdown languages
- Property testing of regular tree languages
- Randomized sliding window algorithms for regular languages
- Recognizing well-parenthesized expressions in the streaming model
- Regular languages are testable with a constant number of queries
- Robust Characterizations of Polynomials with Applications to Program Testing
- Self-testing/correcting with applications to numerical problems
- Spot-checkers
- Streaming algorithms for language recognition problems
- Streaming algorithms for recognizing nearly well-parenthesized expressions
- Streaming Property Testing of Visibly Pushdown Languages *
- Testing membership in parenthesis languages
- The Algorithmic Aspects of the Regularity Lemma
- The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited
This page was built for publication: The trichotomy of regular property testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397600)
