Noga Alon, Michael Krivelevich  Home/Search
Context Related
| math.tau.ac.il/~krivelev/24conf.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~krivelev...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We continue the study of combinatorial property testing, initiated by Goldreich, Goldwasser and Ron in [7]. The subject of this paper is testing regular languages. Our main result is as follows. For a regular language L 2 f0; 1g and an integer n there exists a randomized algorithm which always accepts a word w of length n if w 2 L, and rejects it with high probability if w has to be modified in at least n positions to create a word in L. The algorithm queries ~ O(1=) bits of w. This query ... (Update)
Cited by: More
Testing Properties of Directed Graphs: Acyclicity and Connectivity - Bender, Ron (2000) (Correct)
Property Testing - Ron (2000) (Correct)
Some 3CNF Properties are Hard to Test - Ben-Sasson, Harsha, Raskhodnikova (2003) (Correct)
Similar documents (at the sentence level):
79.7%: Regular Languages are Testable with a Constant Number.. - Alon, Krivelevich.. (1999) (Correct)
Active bibliography (related documents): More All
0.2: On the Automata Size for Presburger Arithmetic - Klaedtke (Correct)
0.1: Curriculum and Course Syllabi for a High-School Program in.. - Gal-Ezer, Harel (Correct)
0.1: About Implementation of Primitive Recursive Algorithms - Andary, Patrou, Valarcher (2005) (Correct)
Similar documents based on text: More All
0.6: Efficient Testing of Large Graphs - Alon, Fischer, Krivelevich, Szegedy (Correct)
0.2: Testing K-Colorability - Alon, Krivelevich (Correct)
0.2: Testing of Function that have small width Branching Programs - Newman (2000) (Correct)
Related documents from co-citation: More All
28: Property testing and its connection to learning and approximation - Goldreich, Goldwasser et al.
28: Robust characterization of polynomials with applications to program testing - Rubinfeld, Sudan - 1996
17: Property testing in bounded degree graphs - Goldreich, Ron - 1997
BibTeX entry: (Update)
N. Alon, M. Krivelevich, I. Newman and M. Szegedy, Regular languages are testable with a constant number of queries, Proceedings of the 40 th IEEE FOCS (1999), to appear. http://citeseer.ist.psu.edu/alon99regular.html More
@inproceedings{ alon99regular,
author = "Noga Alon and Michael Krivelevich and Ilan Newman and Mario Szegedy",
title = "Regular Languages Are Testable with a Constant Number of Queries",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "645-655",
year = "1999",
url = "citeseer.ist.psu.edu/alon99regular.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
173 Proof verification and intractability of approximation probl.. (context) - Arora, Lund et al. - 1992
167 Property testing and its connections to learning and approxi.. - Goldreich, Goldwasser et al. - 1996
115 Robust characterization of polynomials with applications to .. - Rubinfeld, Sudan - 1996
94 Selftesting /correcting with applications to numerical probl.. - Blum, Luby et al. - 1994
86 New directions in testing (context) - Lipton - 1989
57 the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1992
44 CREW PRAMs and decision trees (context) - Nisan - 1989
43 Self testingcorrecting polynomial and approximate function - Rubinfeld, Self et al. - 1991
30 Efficient testing of large graphs - Alon, Fischer et al. - 1999
14 towards a unified measure of complexity (context) - Yao, computation - 1977
6 Complexity and Languages: Fundamentals of Theoretical Comput.. (context) - Davis, Sigal et al. - 1994
4 Proof of a conjecture by Erdos and Graham concerning the pro.. (context) - Dixmier - 1990
4 A bound for a solution of a linear Diophantine problem (context) - Lewin - 1972
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~krivelev/papers.html): More
Triangle Factors in Pseudo-Random Graphs - Krivelevich, Sudakov, Szabo (Correct)
Two-coloring Random Hypergraphs - Achlioptas, Kim, Krivelevich, Tetali (2002) (Correct)
The Concentration of the Chromatic Number of Random Graphs - Alon, Krivelevich (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC