Skip to main navigation Skip to search Skip to main content

Regular languages are testable with a constant number of queries

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

Research output: Contribution to journal › Article › peer-review

Fingerprint

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

Keyphrases

Computer Science