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

by N Alon, M Krivelevich, I Newman, M Szegedy
Venue:SIAM Journal on Computing