Regular languages are testable with a constant number of queries. (1999)

by Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
Venue:In Proc. 40th Annual IEEE Symposium on Foundations of Computer Science,