1. Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. In: IEEE Symposium on Foundations of Computer Science (1999)
2. Apostolico, A., Galil, Z.: Pattern matching algorithms, chapter 14. In: Approximate tree Pattern matching, Oxford University Press, Oxford (1997)
3. Blum, M., Kannan, S.: Designing programs that test their work. In: ACM Symposium on Theory of Computing, pp. 86–97 (1989)
4. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. In: ACM Symposium on Theory of Computing, pp. 73–83 (1990)
5. Chawathe, S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change detection in hierarchically structured information. In: Proceedings of the ACM SIGMOD, pp. 493–504 (1996)