1. Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control 51, 76–87 (1981)
2. Angluin, D.: Learning regular sets from queries and counter examples. Information and Control 75, 87–106 (1987)
3. Angluin, D.: Queries and concept learning. Machine learning 2, 319–342 (1988)
4. Besombes, J., Marion, J.Y.: Identification of reversible dependency tree languages. In: Proceedings of the third Learning Language in Logic workshop, pp. 11–22 (2001)
5. Besombes, J., Marion, J.Y.: Apprentissage des langages réguliers d’arbres et applications. Conférence d’Apprentissage, Orléans 17, 18 et 19 juin 2002, pp. 55–70 (2002)