{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:19:35Z","timestamp":1743135575363,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319321486"},{"type":"electronic","value":"9783319321493"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-32149-3_24","type":"book-chapter","created":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T02:24:42Z","timestamp":1459477482000},"page":"248-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel Induction of Nondeterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Jastrzab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zbigniew J.","family":"Czech","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Wieczorek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37, 302\u2013320 (1978)","journal-title":"Inf. Control"},{"key":"24_CR2","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, 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"24_CR3","unstructured":"Angluin, D.: An application of the theory of computational complexity to the study of inductive inference. Ph.D. thesis, University of California (1976)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"KJ Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-58473-0_152","volume-title":"Grammatical Inference and Applications","author":"P Dupont","year":"1994","unstructured":"Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS (LNAI), vol. 862, pp. 236\u2013245. Springer, Heidelberg (1994)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-70844-5_10","volume-title":"Implementation and Applications of Automata","author":"P Garc\u00eda","year":"2008","unstructured":"Garc\u00eda, P., V\u00e1zquez de Parga, M., \u00c1lvarez, G.I., Ruiz, J.: Learning regular languages using non-deterministic finite automata. In: Ibarra, O.H., Ravikumar, B. (eds.) Implementation and Applications of Automata, pp. 92\u2013101. Springer, New York (2008)"},{"key":"24_CR7","series-title":"AISC","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-319-23437-3_54","volume-title":"Man\u2013Machine Interactions 4","author":"W Wieczorek","year":"2016","unstructured":"Wieczorek, W., Nowakowski, A.: Grammatical inference in the discovery of generating functions. In: Gruca, A., Brachman, A., Czach\u00f3rski, T., Kozielski, S. (eds.) Man\u2013Machine Interactions 4. AISC, vol. 391, pp. 627\u2013637. Springer International Publishing, Switzerland (2016)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Imada, K., Nakamura, K.: Learning context free grammars by using SAT solvers. In: International Conference on Machine Learning and Applications, ICMLA 2009, 13\u201315 December 2009, Miami Beach, FL, USA, pp. 267\u2013272 (2009)","DOI":"10.1109\/ICMLA.2009.28"},{"key":"24_CR9","unstructured":"Wieczorek, W.: Induction of non-deterministic finite automata on supercomputers. In: Heinz, J., de la Higuera, C., Oates, T. (eds.) JMLR Workshop and Conference, Proceedings of the Eleventh International Conference on Grammatical Inference, ICGI 2012, 5\u20138 September 2012, University of Maryland, College Park, USA, vol. 21, pp. 237\u2013242 (2012)"},{"key":"24_CR10","volume-title":"Parallel Programming in C with MPI and OpenMP","author":"MJ Quinn","year":"2004","unstructured":"Quinn, M.J.: Parallel Programming in C with MPI and OpenMP. McGraw-Hill, New York (2004)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"EW Dijkstra","year":"1983","unstructured":"Dijkstra, E.W., Seijen, W.H., van Gasteren, A.J.M.: Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett. 16, 217\u2013219 (1983)","journal-title":"Inf. Process. Lett."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Tomita, M.: Dynamic construction of finite automata from examples using hill-climbing. In: Proceedings of the Fourth Annual Conference of the Cognitive Science Society, pp. 105-108 (1982)","DOI":"10.21236\/ADA120123"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-15488-1_22","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"HI Akram","year":"2010","unstructured":"Akram, H.I., de la Higuera, C., Xiao, H., Eckert, C.: Grammatical inference algorithms in MATLAB. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS, vol. 6339, pp. 262\u2013266. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32149-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T01:11:45Z","timestamp":1607994705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32149-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319321486","9783319321493"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32149-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}