{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:51Z","timestamp":1740099051458,"version":"3.37.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319780238"},{"type":"electronic","value":"9783319780245"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78024-5_25","type":"book-chapter","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T08:28:25Z","timestamp":1521707305000},"page":"279-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Two Parallelization Schemes for the Induction of Nondeterministic Finite Automata on PCs"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Jastrzab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"25_CR1","unstructured":"Alvarez, G., Ruiz, J., Cano, A., Garc\u00eda, P.: Nondeterministic regular positive negative inference NRPNI. In: Proceedings of the XXXI Latin American Informatics Conference (CLEI 2005), pp. 239\u2013249 (2005)"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","volume":"68","author":"R Dechter","year":"1994","unstructured":"Dechter, R., Meiri, I.: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artif. Intell. 68, 211\u2013241 (1994)","journal-title":"Artif. Intell."},{"issue":"2","key":"25_CR3","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 313(2), 267\u2013294 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"25_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E Dijkstra","year":"1983","unstructured":"Dijkstra, E., Seijen, W., van Gasteren, A.: Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett. 16(5), 217\u2013219 (1983)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"25_CR5","doi-asserted-by":"crossref","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 de 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":"25_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R Harallick","year":"1980","unstructured":"Harallick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263\u2013313 (1980)","journal-title":"Artif. Intell."},{"key":"25_CR7","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Boston (1979)"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.procs.2016.05.318","volume":"80","author":"T Jastrzab","year":"2016","unstructured":"Jastrzab, T.: On parallel induction of nondeterministic finite automata. Proc. Comput. Sci. 80, 257\u2013268 (2016)","journal-title":"Proc. Comput. Sci."},{"key":"25_CR9","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 Jastrzab","year":"2016","unstructured":"Jastrzab, 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"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Tomita, M.: Dynamic construction of finite automata from examples using hill-climbing. In: Proceedings of the 4th Annual Conference of the Cognitive Science Society, pp. 105\u2013108 (1982)","DOI":"10.21236\/ADA120123"},{"key":"25_CR11","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 Parga de","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":"25_CR12","unstructured":"Wieczorek, W.: Induction of non-deterministic finite automata on supercomputers. In: Proceedings of the 11th International Conference on Grammatical Inference (ICGI 2012), JMLR Workshop and Conference Proceedings, vol. 21, pp. 237\u2013242 (2012)"},{"key":"25_CR13","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. SCI, vol. 673. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-46801-3"},{"key":"25_CR14","unstructured":"Wieczorek, W., Unold, O.: Induction of directed acyclic word graph in a bioinformatics task. In: Proceedings of the 12th International Conference on Grammatical Inference (ICGI 2014), JMLR Workshop and Conference Proceedings, vol. 34, pp. 207\u2013217 (2014)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Wieczorek, W., Unold, O.: Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides. Comput. Math. Methods Med. 2016, Article ID 1782732 (2016)","DOI":"10.1155\/2016\/1782732"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78024-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T03:55:17Z","timestamp":1570938917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78024-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319780238","9783319780245"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78024-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}