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
- Weight
- Alphabetically
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