1. Learning regular sets from queries and counterexamples;Angluin;Inform. Comput.,1987
2. Derivatives of regular expressions;Brzozowski;J. ACM,1964
3. Efficient ambiguity detection in c-nfa;Coste,2000
4. F. Denis, A. Lemay, A. Terlutte, Learning regular languages using nondeterministic finite automata, in: ICGI’2000, Proc. 5th Internat. Colloquium on Grammatical Inference, Lecture Notes in Artificial Intelligence, Vol. 1891, Springer, Berlin, 2000, pp. 39–50.
5. F. Denis, A. Lemay, A. Terlutte, Residual finite state automata, in: STACS 2001, Lecture Notes in Computer Science, Vol. 2010, Springer, Berlin, 2001, pp. 144–157.