1. Oncina, J., García, P.: Identifying regular languages in polynomial time. In Bunke, H., ed.: Advances in Structural and Syntactic Pattern Recognition. Volume 5 of Series in Machine Perception and Artificial Intelligence. World Scientific (1992) 99–108
2. Pitt, L., Warmuth, M.: The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the Association for Computing Machinery 40 (1993) 95–142
3. Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. In: 21st ACM Symposium on Theory of Computing. (1989) 433–444
4. Sakakibara, Y.: Recent advances of grammatical inference. Theoretical Computer Science 185 (1997) 15–45
5. Lee, S.: Learning of context-free languages: A survey of the literature (1996)