Regular Languages are Testable with a Constant Number of Queries (1999)

by Noga Alon , Michael Krivelevich , Ilan Newman , Mario Szegedy
Venue:SIAM Journal on Computing
Citations:79 - 20 self