Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

136

Voted

FOCS
1999
IEEE

89views Theoretical Computer Science» more FOCS 1999»

Regular Languages Are Testable with a Constant Number of Queries

16 years 16 min ago

Regular Languages Are Testable with a Constant Number of Queries

Download www.cs.tau.ac.il

Noga Alon, Michael Krivelevich, Ilan Newman, Mario

Real-time Traffic

FOCS 1999 | Theoretical Computer Science |

claim paper

Related Content

» Space Complexity vs Query Complexity

» A combinatorial characterization of the testable graph properties its all about regularity

» Approximate schemas sourceconsistency and query answering

» Dense locally testable codes cannot have constant rate and distance

» Classifying Regular Languages via Cascade Products of Automata

» Symmetric LDPC codes are not necessarily locally testable

» Testing Properties of ConstraintGraphs

» Every MinorClosed Property of Sparse Graphs is Testable

» Tolerant Linearity Testing and Locally Testable Codes

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	FOCS
Authors	Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy

Comments (0)