1. Learning regular sets from queries and counterexamples;Angluin;Inform. and Comput.,1987
2. NTS languages are deterministic and congruential;Boasson;J. Comput. System Sci.,1985
3. PAC-learning unambiguous NTS languages;Clark,2006
4. Distributional learning of some context-free languages with a minimally adequate teacher;Clark,2010
5. Learning context free grammars with the syntactic concept lattice;Clark,2010