1. Lecture Notes in Computer Science;Fides Aarts,2010
2. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
3. Angluin, D., Antonopoulos, T., Fisman, D.: Strongly unambiguous Büchi automata are polynomially predictable with membership queries. In: 28th EACSL Annual Conference on Computer Science Logic (CSL) (2020)
4. Angluin, D., Eisenstat, S., Fisman, D.: Learning regular languages via alternating automata. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI) (2015)
5. Angluin, D., Fisman, D.: Learning regular omega languages. In: Proceedings of the 25th International Conference on Algorithmic Learning Theory (ALT) (2014)