STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Efficient Testing of Large Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Property testing and its connection to learning and approximation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
omega-Regular Languages Are Testable with a Constant Number of Queries
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Property Testing in Computational Geometry
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Efficient Testing of Large Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A lower bound for testing juntas
Information Processing Letters
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Robust methods for databases and robotics
ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
Testing monotonicity over graph products
Random Structures & Algorithms
Property testing and parameter testing for permutations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Robust methods for databases and robotics
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Verifying cloud services: present and future
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
We continue the study of combinatorial property testing, initiated by Goldreich, Goldwasser and Ron in 1996. The subject of this paper is testing regular languages. Our main result is as follows. For a regular language L over the binary alphabet, an integer n and a small enough constant \math, there exists a randomized algorithm which always accepts a word w of length n if w belongs to L, and rejects it with high probability if w has to be modified in at least \math positions to create a word in L. The algorithm queries \math polylog \math bits of w. This query complexity is shown to be optimal up to a factor poly-logarithmic in \math. We also discuss testability of more complex languages and show, in particular, that the query complexity required for testing context-free languages cannot be bounded by any function of epsilon. The problem of testing regular languages can be viewed as a part of a very general approach, seeking to probe testability of properties defined by logical means.