Publisher
Springer International Publishing
Reference15 articles.
1. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of IJCAI 2009, pp. 399–404 (2009)
2. Beerten, J., et al.: WALTZ-DB: a benchmark database of amyloidogenic hexapeptides. Bioinform. 31(10), 1698–1700 (2015)
3. Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSAs. Theoret. Comput. Sci. 313(2), 267–294 (2004)
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);P Dupont,1994
5. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco (1979)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Robust models to infer flexible nondeterministic finite automata;Journal of Computational Science;2024-07
2. It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data;Proceedings of the IEEE/ACM 46th International Conference on Software Engineering;2024-02-06
3. GA and ILS for Optimizing the Size of NFA Models;Metaheuristics and Nature Inspired Computing;2022
4. Passive Automata Learning: DFAs and NFAs;Lecture Notes in Computer Science;2022