Testing Membership in Parenthesis Languages

Random Structures and Algorithms

Volumn 22, Issue 1, 2003, Pages 98-138

  Parnas, Michal ^a   Ron, Dana ^b   Rubinfeld, Ronitt ^c  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037236262     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10067     Document Type: Article

References (14)

1. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy, Regular languages are testable with a constant number of queries, SIAM J Comput 34(1) (2000), 1842-1862.
2. M. Bender and D. Ron, Testing properties of directed graphs: Acyclicity and connectivity. Random Struct Alg 20(2) (2002), 184-205.
3. O. Goldreich and D. Ron, Property testing in bounded degree graphs, Algorithmica 32(2) (2002), 302-343.
4. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J ACM 45(4) (1998), 653-750.
5. M. Harrison, Introduction to formal language theory, Addison-Wesley, Reading, MA, 1978.
6. D. E. Knuth, J. H. Morris, and V. R. Pratt, Fast pattern matching in strings, SIAM J Comput 6(2) (1977), 323-350.
7. D. Kozen, Automata and computability, Springer-Verlag, New York, 1997.
8. I. Newman, Testing of functions that have small width branching programs, Proc 41st Annu Symp Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 251-258.
9. M. Parnas and D. Ron, Testing the diameter of graphs, Random Struct Alg 20(2) (2002), 165-183.
10. D. Ron, "Property testing," Handbook of randomized computing, Vol II, Eds., S. Rajasekaran, P. Pardalos, J. Reif, and J. Rolim, 597-649, Kluwer Academic Publishers, Dordrecht, 2001.
11. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J Comput 25(2) (1996), 252-271.
12. N. Chomsky and M. P. Schotzenberger, "The algebraic theory of context-free languages." Computer Programming and Formal Languages, Eds., P. Braffort and D. Hirschberg, 118-161. North Holland, Amsterdam, 1963.
13. A. C. Yao, Probabilistic computation, towards a unified measure of complexity, Proc 18th Annu Symp Foundations of Computer Science, 1977, pp. 222-227.
14. E. Fischer, The art of uninformed decisions: A primer of property testing, Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97-126.