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. In FOCS. pages 645-655, 1999. [doi]

Abstract

Abstract is missing.