1. On the complexity of minimum inference of regular sets
2. Birkendorf, A., Boker, A. and Simon, H. U. “Learning Deterministic Finite Automata from Smallest Counterexamples”. Proceedings of the 9th Annual ACM/SIAM Symposium on Discrete Algorithms, SODA'98. San Francisco, CA, USA. pp.599–608.
3. MINIMAL VALID AUTOMATA OF SAMPLE SEQUENCES FOR DISCRETE EVENT SYSTEMS
4. Chung, S. L. and Li, C. L. “Information Rich Enough Sample Path for Machine Identification”. Proceedings of 2004 IEEE International Conference on System, Man and Cybernetics. Hague, Netherland.
5. System identification of discrete event systems