Regular languages are testable with a constant number of queries

  • Noga Alon
  • , Michael Krivelevich
  • , Ilan Newman
  • , Mario Szegedy

Research output: Contribution to journal › Conference article › peer-review

32 Scopus citations

Fingerprint

Dive into the research topics of 'Regular languages are testable with a constant number of queries'. Together they form a unique fingerprint.

Mathematics

Keyphrases

Computer Science