{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:12:02Z","timestamp":1743135122062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030227494"},{"type":"electronic","value":"9783030227500"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-22750-0_73","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:11:13Z","timestamp":1559931073000},"page":"741-748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Comparison of Selected Variable Ordering Methods for NFA Induction"],"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"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"73_CR1","unstructured":"Alvarez, G., Ruiz, J., Cano, A., Garc\u00eda, P.: Nondeterministic Regular Positive Negative Inference NRPNI. In: Proceedings of CLEI 2005, pp. 239\u2013249 (2005)"},{"key":"73_CR2","unstructured":"Beerten, J., Van Durme, J., Rousseau, F., Schymkowitz, J.: WALTZ-DB. Database of amyloid forming peptides (2014). http:\/\/waltzdb.switchlab.org\/"},{"key":"73_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"Principles and Practice of Constraint Programming \u2014 CP96","author":"C Bessi\u00e8re","year":"1996","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C.: MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 61\u201375. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61551-2_66"},{"issue":"4","key":"73_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"key":"73_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-39857-8_8","volume-title":"Machine Learning: ECML 2003","author":"F Coste","year":"2003","unstructured":"Coste, F., Fredouille, D.: Unambiguous automata inference by means of state-merging methods. In: Lavra\u010d, N., Gamberger, D., Blockeel, H., Todorovski, L. (eds.) ECML 2003. LNCS (LNAI), vol. 2837, pp. 60\u201371. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39857-8_8"},{"key":"73_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C de la Higuera","year":"1997","unstructured":"de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Mach. Learn. 27, 125\u2013138 (1997)","journal-title":"Mach. Learn."},{"key":"73_CR7","unstructured":"Dechter, R., Meiri, I.: Experimental evaluation of preprocessing techniques in constraint satisfaction problems. In: Proceedings of IJCAI 1989, pp. 271\u2013277. Morgan Kaufmann Publishers Inc., San Francisco (1989)"},{"issue":"2","key":"73_CR8","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."},{"issue":"1\u20133","key":"73_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.tcs.2008.05.017","volume":"407","author":"P Garc\u00eda","year":"2008","unstructured":"Garc\u00eda, P., V\u00e1zquez Parga, M., Alvarez, G., Ruiz, J.: Universal automata and NFA learning. Theor. Comput. Sci. 407(1\u20133), 192\u2013202 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"73_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Harallick","year":"1980","unstructured":"Harallick, R.M., Elliot, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263\u2013313 (1980)","journal-title":"Artif. Intell."},{"key":"73_CR11","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company (1979)"},{"key":"73_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.procs.2016.05.318","volume":"80","author":"T Jastrz\u0105b","year":"2016","unstructured":"Jastrz\u0105b, T.: On parallel induction of nondeterministic finite automata. Procedia Comput. Sci. 80, 257\u2013268 (2016)","journal-title":"Procedia Comput. Sci."},{"key":"73_CR13","unstructured":"Jastrz\u0105b, T.: Performance evaluation of selected variable ordering methods for NFA induction (2018). http:\/\/icgi2018.pwr.edu.pl\/public\/ex-abstracts\/jastrzab18.pdf"},{"key":"73_CR14","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 Jastrz\u0105b","year":"2018","unstructured":"Jastrz\u0105b, 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":"73_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-32149-3_24","volume-title":"Parallel Processing and Applied Mathematics","author":"T Jastrz\u0105b","year":"2016","unstructured":"Jastrz\u0105b, T., Czech, Z.J., Wieczorek, W.: Parallel induction of nondeterministic finite automata. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds.) PPAM 2015. LNCS, vol. 9573, pp. 248\u2013257. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32149-3_24"},{"issue":"6","key":"73_CR16","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"73_CR17","unstructured":"Smith, B.M., Grant, S.A.: Trying harder to fail fast. In: Proceedings of ECAI 1998, pp. 249\u2013253. Wiley (1997)"},{"key":"73_CR18","unstructured":"Wieczorek, W.: Induction of non-deterministic finite automata on supercomputers. In: Proceedings of ICGI 2012, vol. 21, pp. 237\u2013242 (2012)"},{"key":"73_CR19","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46801-3","volume-title":"Grammatical Inference","author":"W Wieczorek","year":"2017","unstructured":"Wieczorek, W.: Grammatical Inference. SCI, vol. 673. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-46801-3"},{"key":"73_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1155\/2016\/1782732","volume":"2016","author":"W Wieczorek","year":"2016","unstructured":"Wieczorek, W., Unold, O.: Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides. Comput. Math. Methods Med. 2016, 8 (2016). article ID 1782732","journal-title":"Comput. Math. Methods Med."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22750-0_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T03:51:33Z","timestamp":1686109893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22750-0_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227494","9783030227500"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22750-0_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","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":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","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":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}