1. H. Aizenstein, T. Hegedűs, L. Hellerstein, and L. Pitt. Complexity-theoretic hardness results for query learning. Computational Complexity, 7:19–53, 1998.
2. D. Angluin. Queries and concept learning. Machine Learning, 2:319–342, 1988.
3. Lect Notes Comput Sci;J.L. Balcázar,1999
4. Lect Notes Comput Sci;J.L. Balcázar,1999
5. M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. A model-theoretic approach to regular string relations. In Proceedings of the 16th IEEE Symposium on Logic in Computer Science, pages 431–440, 2001.