Regular Languages are Testable with a Constant Number of Queries

Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy. Regular Languages are Testable with a Constant Number of Queries. SIAM Journal on Computing, 30(6):1842-1862, 2000. [doi]

Abstract

Abstract is missing.