1. Regular languages are testable with a constant number of queries;Alon;Society for Industrial and Applied Mathematics Journal on Computing,2000
2. Noga Alon, Asaf Shapira, Testing satisfiability, in: Symposium on Discrete Algorithms, 2002, pp. 645–654.
3. The cost of traveling between languages;Benedikt,2011
4. Abstract combinatorial programs and efficient property testers;Czumaj;Society for Industrial and Applied Mathematics Journal on Computing,2005
5. The art of uninformed decisions;Fischer;Bulletin of the European Association of Theoritical Computer Science,2001