1. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987). https://doi.org/10.1016/0890-5401(87)90052-6
2. Birget, J.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43(4), 185–190 (1992). https://doi.org/10.1016/0020-0190(92)90198-5
3. Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11–17 July 2009, pp. 1004–1009 (2009). http://ijcai.org/Proceedings/09/Papers/170.pdf
4. Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529–561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y. (1963)
5. Brzozowski, J.A., Tamm, H.: Theory of átomata. Theor. Comput. Sci. 539, 13–27 (2014)