{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T23:03:08Z","timestamp":1764284588752,"version":"3.46.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032120854"},{"type":"electronic","value":"9783032120861"}],"license":[{"start":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T00:00:00Z","timestamp":1764201600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T00:00:00Z","timestamp":1764201600000},"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-12086-1_10","type":"book-chapter","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T08:36:24Z","timestamp":1764146184000},"page":"179-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inference of\u00a0Deterministic Finite Automata via\u00a0Q-Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3410-8808","authenticated-orcid":false,"given":"Elaheh","family":"Hosseinkhani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3696-9222","authenticated-orcid":false,"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,27]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Robotica 17(2), 229\u2013235 (1999). https:\/\/doi.org\/10.1017\/S0263574799271172","DOI":"10.1017\/S0263574799271172"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s10270-024-01160-6","volume":"23","author":"BK Aichernig","year":"2024","unstructured":"Aichernig, B.K., K\u00f6nig, S., Mateis, C., Pferscher, A., Tappler, M.: Learning minimal automata with recurrent neural networks. Softw. Syst. Model. 23(3), 625\u2013655 (2024). https:\/\/doi.org\/10.1007\/s10270-024-01160-6","journal-title":"Softw. Syst. Model."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-31984-9_14","volume-title":"Fundamental Approaches to Software Engineering","author":"T Berg","year":"2005","unstructured":"Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B.: On the correspondence between conformance testing and regular inference. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 175\u2013189. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31984-9_14"},{"issue":"6","key":"10_CR5","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":"10_CR6","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, 11\u201317 July 2009, pp. 1004\u20131009 (2009). http:\/\/ijcai.org\/Proceedings\/09\/Papers\/170.pdf"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Bollig, B., Habermehl, P., Leucker, M., Monmege, B.: A robust class of data languages and an application to learning. Log. Methods Comput. Sci. 10(4) (2014). https:\/\/doi.org\/10.2168\/LMCS-10(4:19)2014","DOI":"10.2168\/LMCS-10(4:19)2014"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-319-07734-5_8","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"N Decker","year":"2014","unstructured":"Decker, N., Habermehl, P., Leucker, M., Thoma, D.: Learning transparent data automata. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 130\u2013149. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07734-5_8"},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967). https:\/\/doi.org\/10.1016\/S0019-9958(67)91165-5","journal-title":"Inf. Control"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/11814771_40","volume-title":"Automated Reasoning","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 483\u2013497. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_40"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-88885-5_5","volume-title":"Automated Technology for Verification and Analysis","author":"E Mu\u0161kardin","year":"2021","unstructured":"Mu\u0161kardin, E., Aichernig, B.K., Pill, I., Pferscher, A., Tappler, M.: AALpy: an active automata learning library. In: Hou, Z., Ganesh, V. (eds.) ATVA 2021. LNCS, vol. 12971, pp. 67\u201373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_5"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Oncina, J., Garc a, P.: Inferring regular languages in polynomial update time. World Scientific (1992).https:\/\/doi.org\/10.1142\/9789812797902_0004","DOI":"10.1142\/9789812797902_0004"},{"key":"10_CR13","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, Global Edition 4e. Pearson (2021)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Tomita, M.: Dynamic construction of finite-state automata from examples using hill-climbing. In: Proceedings of the Fourth Annual Conference of the Cognitive Science Society, Ann Arbor, MI, USA, pp. 105\u2013108 (1982). https:\/\/apps.dtic.mil\/sti\/pdfs\/ADA120123.pdf","DOI":"10.21236\/ADA120123"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"FW Vaandrager","year":"2017","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12086-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T23:02:04Z","timestamp":1764284524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12086-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,27]]},"ISBN":["9783032120854","9783032120861"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12086-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,27]]},"assertion":[{"value":"27 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBMF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Recife","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","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":"3 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbmf2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sbmf2025.ufrpe.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}