{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:31:03Z","timestamp":1742945463570,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031359941"},{"type":"electronic","value":"9783031359958"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-35995-8_10","type":"book-chapter","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T07:02:24Z","timestamp":1687935744000},"page":"134-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Inference of\u00a0Over-Constrained NFA of\u00a0Size $$k+1$$ to\u00a0Efficiently and\u00a0Systematically Derive NFA of\u00a0Size k for\u00a0Grammar Learning"],"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":[[2023,6,26]]},"reference":[{"key":"10_CR1","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of IJCAI 2009, pp. 399\u2013404 (2009)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.tcs.2003.11.008","volume":"313","author":"F Denis","year":"2004","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2), 267\u2013294 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR3","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco (1979)"},{"key":"10_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139194655","volume-title":"Grammatical Inference: Learning Automata and Grammars","author":"C de la Higuera","year":"2010","unstructured":"de la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, Cambridge (2010)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-94144-8_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Ignatiev","year":"2018","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"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Jastrzab, T.: On parallel induction of nondeterministic finite automata. In: Proceedings of ICCS 2016. Procedia Computer Science, vol. 80, pp. 257\u2013268. Elsevier (2016)","DOI":"10.1016\/j.procs.2016.05.318"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-78024-5_25","volume-title":"Parallel Processing and Applied Mathematics","author":"T Jastrzab","year":"2018","unstructured":"Jastrzab, T.: Two parallelization schemes for the induction of nondeterministic finite automata on PCs. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds.) PPAM 2017. LNCS, vol. 10777, pp. 279\u2013289. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78024-5_25"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/978-3-030-22750-0_73","volume-title":"Computational Science \u2013 ICCS 2019","author":"T Jastrz\u0105b","year":"2019","unstructured":"Jastrz\u0105b, T.: A comparison of selected variable ordering methods for NFA induction. In: Rodrigues, J.M.F., et al. (eds.) ICCS 2019. LNCS, vol. 11540, pp. 741\u2013748. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22750-0_73"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.3233\/FI-2021-2004","volume":"178","author":"T Jastrzab","year":"2021","unstructured":"Jastrzab, T., Czech, Z.J., Wieczorek, W.: Parallel algorithms for minimal nondeterministic finite automata inference. Fundam. Inform. 178(3), 203\u2013227 (2021). https:\/\/doi.org\/10.3233\/FI-2021-2004","journal-title":"Fundam. Inform."},{"key":"10_CR10","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, virtual, 1\u20132 November 2022. IEEE (2022)","DOI":"10.1109\/ICTAI56018.2022.00205"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Lardeux, F., Monfroy, E.: GA and ILS for optimizing the size of NFA models. In: The 8th International Conference on Metaheuristics and Nature Inspired Computing (META), Marrakech, Morocco (2021), https:\/\/hal.univ-angers.fr\/hal-03284541","DOI":"10.1007\/978-3-030-94216-8_14"},{"key":"10_CR12","doi-asserted-by":"publisher","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, Washington, DC, USA, 1\u20133 November 2021, pp. 396\u2013403. IEEE (2021). https:\/\/doi.org\/10.1109\/ICTAI52525.2021.00065","DOI":"10.1109\/ICTAI52525.2021.00065"},{"key":"10_CR13","unstructured":"Lecoutre, C., Szczepanski, N.: PYCSP3: modeling combinatorial constrained problems in python. CoRR abs\/2009.00326 (2020). https:\/\/arxiv.org\/abs\/2009.00326"},{"volume-title":"Handbook of Constraint Programming, Foundations of Artificial Intelligence","year":"2006","key":"10_CR14","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol. 2. Elsevier, Amsterdam (2006)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-319-07124-4_8","volume-title":"Handbook of Heuristics","author":"T St\u00fctzle","year":"2018","unstructured":"St\u00fctzle, T., Ruiz, R.: Iterated local search. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 579\u2013605. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_8"},{"key":"10_CR16","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, pp. 105\u2013108 (1982)","DOI":"10.21236\/ADA120123"},{"key":"10_CR17","series-title":"Symbolic Computation","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-81955-1_28","volume-title":"Automation of Reasoning","author":"GS Tseitin","year":"1983","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Siekmann, J.H., Wrightson, G. (eds.) Automation of Reasoning. Symbolic Computation, pp. 466\u2013483. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/978-3-642-81955-1_28"},{"key":"10_CR18","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":"10_CR19","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46801-3","volume-title":"Grammatical Inference - Algorithms, Routines and Applications","author":"W Wieczorek","year":"2017","unstructured":"Wieczorek, W.: Grammatical Inference - Algorithms, Routines and Applications. Studies in Computational Intelligence, vol. 673. Springer, Hedelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-46801-3"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35995-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T14:02:49Z","timestamp":1691071369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35995-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031359941","9783031359958"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35995-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"530","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"188","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}