Regular languages are testable with a constant number of queries

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 645-655

  Alon, Noga ^a   Krivelevich, Michael ^a   Newman, Ilan ^a   Szegedy, Mario ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CONTEXT FREE LANGUAGES; PROBABILITY; RANDOM PROCESSES;

QUERY COMPLEXITY; TESTABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0032614554     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)