{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:54:09Z","timestamp":1757627649498,"version":"3.44.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032045867"},{"type":"electronic","value":"9783032045874"}],"license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04587-4_9","type":"book-chapter","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T09:28:52Z","timestamp":1756805332000},"page":"135-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unsupervised Automata Learning via\u00a0Discrete Optimization"],"prefix":"10.1007","author":[{"given":"Simon","family":"Lutz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniil","family":"Kaminskyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Wittbold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Dierl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Neider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.W.: Automata learning through counterexample guided abstraction refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012: Formal Methods - 18th International Symposium, Paris, France, August 27-31, 2012. Proceedings. Lecture Notes in Computer Science, vol.\u00a07436, pp. 10\u201327. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_4","DOI":"10.1007\/978-3-642-32759-9_4"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Aarts, F., Vaandrager, F.W.: Learning I\/O automata. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06269, pp. 71\u201385. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_6","DOI":"10.1007\/978-3-642-15375-4_6"},{"key":"9_CR3","unstructured":"Aarts, F.D.: Tomte: bridging the gap between active learning and real-world systems. Sl: sn (2014)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Aichernig, B.K., Mostowski, W., Mousavi, M.R., Tappler, M., Taromirad, M.: Model learning and model-based testing. In: Machine Learning for Dynamic Software Analysis: Potentials and Limits: International Dagstuhl Seminar 16172, Dagstuhl Castle, Germany, April 24-27, 2016, Revised Papers, pp. 74\u2013100. Springer (2018)","DOI":"10.1007\/978-3-319-96562-8_3"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"key":"9_CR6","unstructured":"Angluin, D., Eisenstat, S., Fisman, D.: Learning regular languages via alternating automata. In: Yang, Q., Wooldridge, M.J. (eds.) Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pp. 3308\u20133314. AAAI Press (2015). http:\/\/ijcai.org\/Abstract\/15\/466"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Balle, B., Mohri, M.: Learning weighted automata. In: Maletti, A. (ed.) Algebraic Informatics - 6th International Conference, CAI 2015, Stuttgart, Germany, September 1-4, 2015. Proceedings. Lecture Notes in Computer Science, vol.\u00a09270, pp. 1\u201321. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-23021-4_1","DOI":"10.1007\/978-3-319-23021-4_1"},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1137\/S009753979326091X","volume":"25","author":"F Bergadano","year":"1996","unstructured":"Bergadano, F., Varricchio, S.: Learning behaviors of automata from multiplicity and equivalence queries. SIAM J. Comput. 25(6), 1268\u20131280 (1996). https:\/\/doi.org\/10.1137\/S009753979326091X","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"21","author":"AW Biermann","year":"1972","unstructured":"Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput. 21(6), 592\u2013597 (1972). https:\/\/doi.org\/10.1109\/TC.1972.5009015","journal-title":"IEEE Trans. Comput."},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rklund, J., Fernau, H., Kasprzik, A.: MAT learning of universal automata. In: Dediu, A., Mart\u00edn-Vide, C., Truthe, B. (eds.) Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings. Lecture Notes in Computer Science, vol.\u00a07810, pp. 141\u2013152. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-37064-9_14","DOI":"10.1007\/978-3-642-37064-9_14"},{"key":"9_CR11","unstructured":"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, July 11-17, 2009, pp. 1004\u20131009 (2009). http:\/\/ijcai.org\/Proceedings\/09\/Papers\/170.pdf"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Garhewal, B., P\u00e9rez, G.A., Staquet, G., Vaandrager, F.W.: Active learning of mealy machines with timers. CoRR abs\/2403.02019 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2403.02019","DOI":"10.48550\/ARXIV.2403.02019"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/S00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233\u2013263 (2016). https:\/\/doi.org\/10.1007\/S00165-016-0355-5","journal-title":"Formal Aspects Comput."},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: a survey. ACM Comput. Surv. 41(3), 15:1\u201315:58 (2009). https:\/\/doi.org\/10.1145\/1541880.1541882","DOI":"10.1145\/1541880.1541882"},{"key":"9_CR15","unstructured":"Frohme, M.T.: Active automata learning with adaptive distinguishing sequences. CoRR abs\/1902.01139 (2019). http:\/\/arxiv.org\/abs\/1902.01139"},{"issue":"04","key":"9_CR16","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1142\/S021800149000037X","volume":"4","author":"P Garc\u00eda","year":"1990","unstructured":"Garc\u00eda, P., Segarra, E., Vidal, E., Galiano, I.: On the use of the morphic generator grammatical inference (MGGI) methodology in automatic speech recognition. Int. J. Pattern Recognit. Artif. Intell. 4(04), 667\u2013685 (1990)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Garhewal, B., Vaandrager, F.W., Howar, F., Schrijvers, T., Lenaerts, T., Smits, R.: Grey-box learning of register automata. In: Dongol, B., Troubitsyna, E. (eds.) Integrated Formal Methods - 16th International Conference, IFM 2020, Lugano, Switzerland, November 16-20, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12546, pp. 22\u201340. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-63461-2_2","DOI":"10.1007\/978-3-030-63461-2_2"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37(3), 302\u2013320 (1978). https:\/\/doi.org\/10.1016\/S0019-9958(78)90562-4","journal-title":"Inf. Control"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings. Lecture Notes in Computer Science, vol.\u00a04130, pp. 483\u2013497. Springer (2006). https:\/\/doi.org\/10.1007\/11814771_40","DOI":"10.1007\/11814771_40"},{"issue":"5","key":"9_CR20","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1093\/jigpal\/jzl007","volume":"14","author":"A Groce","year":"2006","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Logic J. IGPL 14(5), 729\u2013744 (2006)","journal-title":"Logic J. IGPL"},{"key":"9_CR21","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.entcs.2005.01.044","volume":"138","author":"P Habermehl","year":"2005","unstructured":"Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. Electron. Notes Theoret. Comput. Sci. 138(3), 21\u201336 (2005)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"van Heerdt, G., Kupke, C., Rot, J., Silva, A.: Learning weighted automata over principal ideal domains. In: Goubault-Larrecq, J., K\u00f6nig, B. (eds.) Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12077, pp. 602\u2013621. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_31","DOI":"10.1007\/978-3-030-45231-5_31"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Heule, M., Verwer, S.: Exact DFA identification using SAT solvers. In: Sempere, J.M., Garc\u00eda, P. (eds.) Grammatical Inference: Theoretical Results and Applications, 10th International Colloquium, ICGI 2010, Valencia, Spain, September 13-16, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06339, pp. 66\u201379. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15488-1_7","DOI":"10.1007\/978-3-642-15488-1_7"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"De\u00a0la Higuera, C.: Grammatical inference: learning automata and grammars. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139194655"},{"key":"9_CR26","unstructured":"Howar, F.: Active learning of interface programs. Ph.D. thesis, Dortmund University of Technology (2012). https:\/\/hdl.handle.net\/2003\/29486"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-45069-6_31","volume-title":"Computer Aided Verification","author":"H Hungar","year":"2003","unstructured":"Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 315\u2013327. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_31"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Irfan, M.N., Oriat, C., Groz, R.: Angluin style finite state machine inference with non-optimal counterexamples. In: Proceedings of the First International Workshop on Model Inference In Testing, pp. 11\u201319. MIIT \u201910, Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1868044.1868046","DOI":"10.1145\/1868044.1868046"},{"key":"9_CR29","unstructured":"Isberner, M.: Foundations of active automata learning: an algorithmic perspective. Ph.D. thesis, Technical University Dortmund, Germany (2015). https:\/\/hdl.handle.net\/2003\/34282"},{"issue":"1\u20132","key":"9_CR30","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/S10994-013-5419-7","volume":"96","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning register automata: from languages to program structures. Mach. Learn. 96(1\u20132), 65\u201398 (2014). https:\/\/doi.org\/10.1007\/S10994-013-5419-7","journal-title":"Mach. Learn."},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) Runtime Verification - 5th International Conference, RV 2014, Toronto, ON, Canada, September 22-25, 2014. Proceedings. Lecture Notes in Computer Science, vol.\u00a08734, pp. 307\u2013322. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26","DOI":"10.1007\/978-3-319-11164-3_26"},{"key":"9_CR32","unstructured":"Isberner, M., Steffen, B.: An abstract framework for counterexample analysis in active automata learning. In: Clark, A., Kanazawa, M., Yoshinaka, R. (eds.) Proceedings of the 12th International Conference on Grammatical Inference, ICGI 2014, Kyoto, Japan, September 17-19, 2014. JMLR Workshop and Conference Proceedings, vol.\u00a034, pp. 79\u201393. JMLR.org (2014). http:\/\/proceedings.mlr.press\/v34\/isberner14a.html"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press (1994). https:\/\/mitpress.mit.edu\/books\/introduction-computational-learning-theory","DOI":"10.7551\/mitpress\/3897.001.0001"},{"issue":"2","key":"9_CR34","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(94)90033-7","volume":"129","author":"T Knuutila","year":"1994","unstructured":"Knuutila, T., Steinby, M.: The inference of tree languages from finite samples: an algebraic approach. Theor. Comput. Sci. 129(2), 337\u2013367 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90033-7","journal-title":"Theor. Comput. Sci."},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) Grammatical Inference, 4th International Colloquium, ICGI-98, Ames, Iowa, USA, July 12-14, 1998, Proceedings. Lecture Notes in Computer Science, vol.\u00a01433, pp. 1\u201312. Springer (1998). https:\/\/doi.org\/10.1007\/BFB0054059","DOI":"10.1007\/BFB0054059"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Leucker, M., Neider, D.: Learning minimal deterministic automata from inexperienced teachers. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change - 5th International Symposium, ISoLA 2012, Heraklion, Crete, Greece, October 15-18, 2012, Proceedings, Part I. Lecture Notes in Computer Science, vol.\u00a07609, pp. 524\u2013538. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_39","DOI":"10.1007\/978-3-642-34026-0_39"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Lutz, S., et al.: Unsupervised automata learning via discrete optimization (2025). https:\/\/arxiv.org\/abs\/2303.14111","DOI":"10.1007\/978-3-032-04587-4_9"},{"issue":"2","key":"9_CR38","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/INCO.1995.1070","volume":"118","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316\u2013326 (1995). https:\/\/doi.org\/10.1006\/INCO.1995.1070","journal-title":"Inf. Comput."},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Merten, M., Howar, F., Steffen, B., Margaria, T.: Automata learning with on-the-fly direct hypothesis construction. In: H\u00e4hnle, R., Knoop, J., Margaria, T., Schreiner, D., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification, and Validation - International Workshops, SARS 2011 and MLSC 2011, Held Under the Auspices of ISoLA 2011 in Vienna, Austria, October 17-18, 2011. Revised Selected Papers. Communications in Computer and Information Science, vol.\u00a0336, pp. 248\u2013260. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-34781-8_19","DOI":"10.1007\/978-3-642-34781-8_19"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Neider, D.: Computing minimal separating DFAs and regular invariants using SAT and SMT solvers. In: Chakraborty, S., Mukund, M. (eds.) Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings. Lecture Notes in Computer Science, vol.\u00a07561, pp. 354\u2013369. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_28","DOI":"10.1007\/978-3-642-33386-6_28"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Neider, D., Gaglione, J., Gavran, I., Topcu, U., Wu, B., Xu, Z.: Advice-guided reinforcement learning in a non-markovian environment. In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 9073\u20139080. AAAI Press (2021). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/17096","DOI":"10.1609\/aaai.v35i10.17096"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Neider, D., Jansen, N.: Regular model checking using solver technologies and automata learning. In: Brat, G., Rungta, N., Venet, A. (eds.) NASA Formal Methods, 5th International Symposium, NFM 2013, Moffett Field, CA, USA, May 14-16, 2013. Proceedings. Lecture Notes in Computer Science, vol.\u00a07871, pp. 16\u201331. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-38088-4_2","DOI":"10.1007\/978-3-642-38088-4_2"},{"key":"9_CR43","unstructured":"Niese, O.: An integrated approach to testing complex systems. Ph.D. thesis, Technical University of Dortmund, Germany (2003). http:\/\/eldorado.uni-dortmund.de:8080\/0x81d98002_0x0007b62b"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Oliner, A., Stearley, J.: What supercomputers say: a study of five system logs. In: 37th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN\u201907), pp. 575\u2013584 (2007). https:\/\/doi.org\/10.1109\/DSN.2007.103","DOI":"10.1109\/DSN.2007.103"},{"key":"9_CR45","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1010828029885","volume":"44","author":"AL Oliveira","year":"2001","unstructured":"Oliveira, A.L., Silva, J.P.: Efficient algorithms for the inference of minimum size DFAs. Mach. Learn. 44, 93\u2013119 (2001)","journal-title":"Mach. Learn."},{"key":"9_CR46","unstructured":"Oncina, J., Garc\u0131a, P.: Inference of recognizable tree sets. Tech. rep., Tech. report, Universidad de Alicante, 1993. DSIC-II\/47\/93 (1993)"},{"issue":"49\u201361","key":"9_CR47","first-page":"10","volume":"1","author":"J Oncina","year":"1992","unstructured":"Oncina, J., Garcia, P., et al.: Inferring regular languages in polynomial update time. Pattern Recognit Image Anal. 1(49\u201361), 10\u20131142 (1992)","journal-title":"Pattern Recognit Image Anal."},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"Petrenko, A., Li, K., Groz, R., Hossen, K., Oriat, C.: Inferring approximated models for systems engineering. In: 15th International IEEE Symposium on High-Assurance Systems Engineering, HASE 2014, Miami Beach, FL, USA, January 9-11, 2014, pp. 249\u2013253. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/HASE.2014.46","DOI":"10.1109\/HASE.2014.46"},{"key":"9_CR49","unstructured":"Rieger, A.: Inferring probabilistic automata from sensor data for robot navigation. Univ., Fachbereich Informatik, Lehrstuhl 8 (1995)"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 411\u2013420 (1989)","DOI":"10.1145\/73007.73047"},{"issue":"2","key":"9_CR51","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/INCO.1993.1021","volume":"103","author":"RL Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993). https:\/\/doi.org\/10.1006\/INCO.1993.1021","journal-title":"Inf. Comput."},{"key":"9_CR52","unstructured":"Ruff, L., et al.: Deep one-class classification. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a080, pp. 4393\u20134402. PMLR (2018). https:\/\/proceedings.mlr.press\/v80\/ruff18a.html"},{"key":"9_CR53","doi-asserted-by":"publisher","unstructured":"Shahbaz, M., Groz, R.: Inferring mealy machines. In: Cavalcanti, A., Dams, D. (eds.) FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings. Lecture Notes in Computer Science, vol.\u00a05850, pp. 207\u2013222. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-05089-3_14","DOI":"10.1007\/978-3-642-05089-3_14"},{"key":"9_CR54","doi-asserted-by":"publisher","unstructured":"Shridhar, M., et al.: ALFRED: a benchmark for interpreting grounded instructions for everyday tasks. In: 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 10737\u201310746. IEEE, New York, NY, USA (2020). https:\/\/doi.org\/10.1109\/CVPR42600.2020.01075, CVPR 2020","DOI":"10.1109\/CVPR42600.2020.01075"},{"key":"9_CR55","doi-asserted-by":"publisher","unstructured":"Shvo, M., Li, A.C., Icarte, R.T., McIlraith, S.A.: Interpretable sequence classification via discrete optimization. Proc. AAAI Conf. Artif. Intell. 35(11), 9647\u20139656 (2021). https:\/\/doi.org\/10.1609\/aaai.v35i11.17161, AAAI 2021","DOI":"10.1609\/aaai.v35i11.17161"},{"key":"9_CR56","unstructured":"Trakhtenbrot, B.A., Barzdin, Y.M.: Finite automata: Behavior and synthesis. Elsevier (1973)"},{"key":"9_CR57","doi-asserted-by":"publisher","unstructured":"Vaandrager, F.W., Garhewal, B., Rot, J., Wi\u00dfmann, T.: A new approach for active automata learning based on apartness. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13243, pp. 223\u2013243. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_12","DOI":"10.1007\/978-3-030-99524-9_12"},{"key":"9_CR58","doi-asserted-by":"publisher","unstructured":"Xu, W., Huang, L., Fox, A., Patterson, D., Jordan, M.I.: Detecting large-scale system problems by mining console logs. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 117\u2013132. SOSP \u201909, Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1629575.1629587","DOI":"10.1145\/1629575.1629587"},{"key":"9_CR59","doi-asserted-by":"publisher","unstructured":"Zhu, J., He, S., He, P., Liu, J., Lyu, M.R.: Loghub: a large collection of system log datasets for AI-driven log analytics. In: 34th IEEE International Symposium on Software Reliability Engineering, ISSRE 2023, Florence, Italy, October 9-12, 2023, pp. 355\u2013366. IEEE (2023). https:\/\/doi.org\/10.1109\/ISSRE59848.2023.00071","DOI":"10.1109\/ISSRE59848.2023.00071"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04587-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:09:58Z","timestamp":1757477398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04587-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"ISBN":["9783032045867","9783032045874"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04587-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"29 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kutaisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}