{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:06:39Z","timestamp":1742990799213,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031779404"},{"type":"electronic","value":"9783031779411"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-77941-1_21","type":"book-chapter","created":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T08:44:40Z","timestamp":1737881080000},"page":"277-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust Models for\u00a0Learning Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7854-9058","authenticated-orcid":false,"given":"Tomasz","family":"Jastrz\u0105b","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8636-3870","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Lardeux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7970-1368","authenticated-orcid":false,"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,27]]},"reference":[{"key":"21_CR1","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of IJCAI 2009, pp. 399\u2013404 (2009)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2), 267\u2013294 (2004)","DOI":"10.1016\/j.tcs.2003.11.008"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"de\u00a0la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139194655"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a Python toolkit for prototyping with SAT oracles. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 428\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26","DOI":"10.1007\/978-3-319-94144-8_26"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Jastrz\u0105b, T.: Two parallelization schemes for the induction of nondeterministic finite automata on PCs. In: Proceedings of PPAM 2017. LNCS, vol. 10777, pp. 279\u2013289. Springer (2017)","DOI":"10.1007\/978-3-319-78024-5_25"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Jastrz\u0105b, T., Czech, Z.J., Wieczorek, W.: Parallel algorithms for minimal nondeterministic finite automata inference. Fundam. Informaticae 178(3), 203\u2013227 (2021)","DOI":"10.3233\/FI-2021-2004"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Jastrz\u0105b, T., Lardeux, F., Monfroy, E.: Inference of over-constrained NFA of size $$k+1$$ to efficiently and systematically derive NFA of size $$k$$ for grammar learning. In: Proceedings of the International Conference on Computational Science \u2013 ICCS 2023, Part I. LNCS, vol. 14073, pp. 134\u2013147. Springer (2023)","DOI":"10.1007\/978-3-031-35995-8_10"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Jastrz\u0105b, T., Lardeux, F., Monfroy, E.: Taking advantage of a very simple property to efficiently infer NFAs. In: 34th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2022, pp. 1355\u20131361. IEEE (2022)","DOI":"10.1109\/ICTAI56018.2022.00205"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Jastrz\u0105b, T., Lardeux, F., Monfroy, E.: Classifying words with 3-sort automata. In: Proceedings of the 16th International Conference on Agents and Artificial Intelligence \u2013 ICAART, pp. 1179\u20131188. SciTePress (2024)","DOI":"10.5220\/0012454100003636"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Jastrz\u0105b, T., Lardeux, F., Monfroy, E.: Classifying words with 3-sort automata. In: The 39th ACM\/SIGAPP Symposium On Applied Computing (ACM SAC) 2024, pp. 787\u2013788. ACM (2024)","DOI":"10.1145\/3605098.3636142"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Lardeux, F., Monfroy, E.: Optimized models and symmetry breaking for the NFA inference problem. In: 33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2021, pp. 396\u2013403. IEEE (2021)","DOI":"10.1109\/ICTAI52525.2021.00065"},{"key":"21_CR12","unstructured":"Lecoutre, C., Szczepanski, N.: PYCSP3: modeling combinatorial constrained problems in Python. arXiv preprint arXiv:2009.00326 (2020)"},{"key":"21_CR13","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol.\u00a02. Elsevier (2006)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Ruiz, R.: Iterated local search. In: Handbook of Heuristics, pp. 579\u2013605. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-07124-4_8"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Tomita, M.: Dynamic construction of finite-state automata from examples using hill-climbing. Proceedings of the Fourth Annual Conference of the Cognitive Science Society, pp. 105\u2013108 (1982)","DOI":"10.21236\/ADA120123"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11812128_25","volume-title":"Implementation and Application of Automata","author":"MV de Parga","year":"2006","unstructured":"de Parga, M.V., Garc\u00eda, P., Ruiz, J.: A family of algorithms for non deterministic regular languages inference. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 265\u2013274. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11812128_25"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Wieczorek, W.: Grammatical Inference. SCI, vol. 673. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-46801-3","DOI":"10.1007\/978-3-319-46801-3"}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77941-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T08:44:47Z","timestamp":1737881087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77941-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031779404","9783031779411"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77941-1_21","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"27 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubrovnik","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2024.sciencesconf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}