{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:03Z","timestamp":1750309323573,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:00:00Z","timestamp":1712534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,8]]},"DOI":"10.1145\/3605098.3636142","type":"proceedings-article","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T17:59:16Z","timestamp":1716314356000},"page":"787-788","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Classifying Words with 3-sort Automata"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7854-9058","authenticated-orcid":false,"given":"Tomasz","family":"Jastrz\u0105b","sequence":"first","affiliation":[{"name":"Silesian University of Technology, Gliwice, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8636-3870","authenticated-orcid":false,"given":"Frederic","family":"Lardeux","sequence":"additional","affiliation":[{"name":"LERIA, University of Angers, Angers, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7970-1368","authenticated-orcid":false,"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[{"name":"LERIA, University of Angers, Angers, France"}]}],"member":"320","published-online":{"date-parts":[[2024,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"399","volume-title":"Proc. of IJCAI 2009","author":"Audemard G.","year":"2009","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proc. of IJCAI 2009. pp. 399--404 (2009)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv027"},{"key":"e_1_3_2_1_3_1","first-page":"60","volume-title":"Fredouille","author":"Coste F.","year":"2003","unstructured":"Coste, F., Fredouille, D.: Unambiguous automata inference by means of state-merging methods. In: Lavrac, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) Machine Learning: ECML 2003, 14th European Conference on Machine Learning, Cavtat-Dubrovnik, Croatia, September 22--26, 2003, Proceedings. Lecture Notes in Computer Science, vol. 2837, pp. 60--71. Springer (2003)"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.11.008"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139194655"},{"key":"e_1_3_2_1_6_1","first-page":"279","volume-title":"Proc. of PPAM 2017","volume":"10777","author":"Jastrz\u0105b T.","year":"2017","unstructured":"Jastrz\u0105b, T.: Two parallelization schemes for the induction of nondeterministic finite automata on PCs. In: Proc. of PPAM 2017. LNCS, vol. 10777, pp. 279--289. Springer (2017)"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI56018.2022.00205"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-35995-8_10"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2401.01314"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI52525.2021.00065"},{"key":"e_1_3_2_1_11_1","first-page":"105","volume-title":"Proc. of the Fourth Annual Conference of the Cognitive Science Society","author":"Tomita M.","year":"1982","unstructured":"Tomita, M.: Dynamic construction of finite-state automata from examples using hill-climbing. Proc. of the Fourth Annual Conference of the Cognitive Science Society pp. 105--108 (1982)"},{"key":"e_1_3_2_1_12_1","first-page":"265","volume-title":"Proc. of CIAA 2006","volume":"4094","author":"V\u00e1zquez de Parga M.","year":"2006","unstructured":"V\u00e1zquez de Parga, M., Garc\u00eda, P., Ruiz, J.: A family of algorithms for non deterministic regular languages inference. In: Proc. of CIAA 2006. LNCS, vol. 4094, pp. 265--274. Springer (2006)"},{"key":"e_1_3_2_1_13_1","volume-title":"Studies in Computational Intelligence","author":"Wieczorek W.","year":"2017","unstructured":"Wieczorek, W.: Grammatical Inference - Algorithms, Routines and Applications, Studies in Computational Intelligence, vol. 673. Springer (2017)"}],"event":{"name":"SAC '24: 39th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Avila Spain","acronym":"SAC '24"},"container-title":["Proceedings of the 39th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605098.3636142","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605098.3636142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:00Z","timestamp":1750291440000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605098.3636142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,8]]},"references-count":13,"alternative-id":["10.1145\/3605098.3636142","10.1145\/3605098"],"URL":"https:\/\/doi.org\/10.1145\/3605098.3636142","relation":{},"subject":[],"published":{"date-parts":[[2024,4,8]]},"assertion":[{"value":"2024-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}