M. Noga-alon, I. Krivelevich, M. Newman, and . Szegedy, Regular languages are testable with a constant number of queries, Society for Industrial and Applied Mathematics Journal on Computing, vol.30, issue.6, pp.1842-1862, 2000.

N. Alon and A. Shapira, Testing satisfiability, Symposium on Discrete Algorithms, pp.645-654, 2002.
DOI : 10.1016/S0196-6774(03)00019-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6677

M. Benedikt, G. Puppis, and C. Riveros, The Cost of Traveling between Languages, the 38th International Colloquium on Automata, Languages and Programming, pp.234-245, 2011.
DOI : 10.1016/0304-3975(95)00188-3
URL : https://hal.archives-ouvertes.fr/hal-00717760

A. Czumaj and C. Sohler, Abstract Combinatorial Programs and Efficient Property Testers, In Society for Industrial and Applied Mathematics Journal on Computing, vol.34, issue.3, pp.580-615, 2005.
DOI : 10.1137/s009753970444199x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.6813

E. Fischer, The art of uninformed decisions, Bulletin of the European Association of Theoritical Computer Science, vol.75, p.97, 2001.

E. Fischer, F. Magniez, and M. De-rougemont, Approximate satisfiability and equivalence, In Society for Industrial and Applied Mathematics Journal on Computing, vol.39, issue.6, pp.2251-2281, 2010.
DOI : 10.1137/070703776
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.7976

P. Gawrychowski, Chrobak Normal Form Revisited, with Applications, the International Conference on Implementation and Application of Automata, pp.142-153, 2011.
DOI : 10.1016/j.ipl.2009.06.005

O. Goldreich, Combinatorial property testing (a survey) In Randomization Methods in Algorithm Design, pp.45-60, 1998.

O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, Journal of the ACM, vol.45, issue.4, pp.653-750, 1998.
DOI : 10.1145/285055.285060
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.6097

I. Newman and C. Sohler, Every property of hyperfinite graphs is testable, Symposium on Theory of Computing, pp.675-684, 2011.

I. Newman, Testing Membership in Languages that Have Small Width Branching Programs, SIAM Journal on Computing, vol.31, issue.5, pp.1557-1570, 2002.
DOI : 10.1137/S009753970038211X

D. Ron, Property Testing: A Learning Theory Perspective, Foundations and Trends in Machine Learning, pp.307-402, 2008.
DOI : 10.1561/2200000004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.2926

D. Ron, R. Rubinfeld, M. Safra, and O. Weinstein, Approximating the Influence of Monotone Boolean Functions in O( ? n) Query Complexity In Random Approx, pp.664-675, 2011.

M. De, R. , and A. Vieilleribiere, Approximate Structural Consistency. SOFtware SEMinar, pp.685-696, 2010.

R. Rubinfeld and M. Sudan, Robust Characterizations of Polynomials with Applications to Program Testing, SIAM Journal on Computing, vol.25, issue.2, pp.252-271, 1996.
DOI : 10.1137/S0097539793255151