Regular languages are testable with a constant number of queries

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

Research output: Contribution to journalConference articlepeer-review

29 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.

Engineering & Materials Science