Regular languages are testable with a constant number of queries
- 20 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Efficient testing of large graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Property testing and its connection to learning and approximationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Robust Characterizations of Polynomials with Applications to Program TestingSIAM Journal on Computing, 1996
- Self-testing/correcting with applications to numerical problemsJournal of Computer and System Sciences, 1993
- On the degree of Boolean functions as real polynomialsPublished by Association for Computing Machinery (ACM) ,1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Self-testing/correcting for polynomials and for approximate functionsPublished by Association for Computing Machinery (ACM) ,1991
- Proof of a conjecture by Erdős and Graham concerning the problem of FrobeniusJournal of Number Theory, 1990
- CREW PRAMS and decision treesPublished by Association for Computing Machinery (ACM) ,1989
- Probabilistic computations: Toward a unified measure of complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977