乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T17:23:42Z","timestamp":1720718622744},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T00:00:00Z","timestamp":1464048000000},"content-version":"vor","delay-in-days":144,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2016]]},"DOI":"10.1016\/j.procs.2016.05.318","type":"journal-article","created":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T23:06:19Z","timestamp":1464822379000},"page":"257-268","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["On Parallel Induction of Nondeterministic Finite Automata"],"prefix":"10.1016","volume":"80","author":[{"given":"Tomasz","family":"Jastrzab","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2016.05.318_bib0005","unstructured":"G. I. Alvarez, J. Ruiz, A. Cano, and P. Garc\u00eda. Nondeterministic regular positive negative inference nrpni. In Proceedings of the XXXI Latin American Informatics Conference (CLEI\u20192005), pages 239-249, 2005."},{"key":"10.1016\/j.procs.2016.05.318_bib0010","unstructured":"D. Angluin. An application of the theory of computational complexity to the study of inductive inference. PhD thesis, University of California, USA, 1976."},{"key":"10.1016\/j.procs.2016.05.318_bib0015","unstructured":"J. Beerten, J. Van Durme, F. Rousseau, and J. Schymkowitz. WALTZ-DB. database of amyloid forming peptides. [online]. http:\/\/waltzdb.switchlab.org\/, last access: 30\/01\/2016."},{"key":"10.1016\/j.procs.2016.05.318_bib0020","doi-asserted-by":"crossref","unstructured":"F. Coste and D. Fredouille. Unambiguous automata inference by means of state merging methods. In Machine Learning: ECML 2003: 14th European Conference on Machine Learning, volume 2837 of LNCS (LNAI), pages 60-71, Heidelberg, 2003. Springer.","DOI":"10.1007\/978-3-540-39857-8_8"},{"key":"10.1016\/j.procs.2016.05.318_bib0025","doi-asserted-by":"crossref","unstructured":"M. V\u00e1zquez de Parga, P. Garc\u00eda, and J. Ruiz. A family of algorithms for non deterministic regular languages inference. In Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA 2006), volume 4094 of LNCS, pages 265-274, Berlin Heidelberg, 2006. Springer-Verlag.","DOI":"10.1007\/11812128_25"},{"issue":"2","key":"10.1016\/j.procs.2016.05.318_bib0030","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.tcs.2003.11.008","article-title":"Learning regular languages using rfsas","volume":"313","author":"Denis","year":"2004","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.procs.2016.05.318_bib0035","series-title":"In ICGI\u201994 Proceedings of the Second International Colloquium on Grammatical Inference and Applications","first-page":"236","article-title":"Regular grammatical inference from positive and negative samples by genetic search: the gig method","author":"Dupont","year":"1994"},{"key":"10.1016\/j.procs.2016.05.318_bib0040","doi-asserted-by":"crossref","unstructured":"P. Garc\u00eda, M. V\u00e1zquez de Parga, G.I. Alvarez, and J. Ruiz. Learning regular languages using non-deterministic finite automata. In Proceedings of the 13th International Conference on Implementation and Application of Automata (CIAA 2008), volume 5148 of LNCS, pages 92-101, Berlin Heidelberg, 2008. Springer-Verlag.","DOI":"10.1007\/978-3-540-70844-5_10"},{"issue":"1\u20133","key":"10.1016\/j.procs.2016.05.318_bib0045","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.tcs.2008.05.017","article-title":"Universal automata and nfa learning","volume":"407","author":"Garc\u00eda","year":"2008","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/j.procs.2016.05.318_bib0050","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given data","volume":"37","author":"Gold","year":"1978","journal-title":"Information and Control"},{"key":"10.1016\/j.procs.2016.05.318_bib0055","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/j.procs.2016.05.318_bib0060","doi-asserted-by":"crossref","unstructured":"K. Imada and K. Nakamura . Learning context free grammars by using sat solvers. In ICMLA\u201909: International Conference on Machine Learning and Applications, pages 267-272, 2009.","DOI":"10.1109\/ICMLA.2009.28"},{"key":"10.1016\/j.procs.2016.05.318_bib0065","doi-asserted-by":"crossref","unstructured":"T. Jastrzab, Z.J. Czech, and W. Wieczorek. Parallel induction of nondeterministic finite automata. In Proceedings of the 11th International Conference on Parallel Processing and Applied Mathematics (PPAM 2015), 2015.","DOI":"10.1007\/978-3-319-32149-3_24"},{"key":"10.1016\/j.procs.2016.05.318_bib0070","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1137\/0222067","article-title":"Minimal nfa problems are hard","volume":"22","author":"Jiang","year":"1993","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.procs.2016.05.318_bib0075","doi-asserted-by":"crossref","unstructured":"K. J. Lang, B.A. Pearlmutter, and R. A. Price. Results of the abbadingo one dfa learning competition and a new evidence-driven state merging algorithm. In Proceedings of the 4th International Colloquium on Grammatical Inference, pages 1-12. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0054059"},{"key":"10.1016\/j.procs.2016.05.318_bib0080","doi-asserted-by":"crossref","unstructured":"J. Oncina and P. Garc\u00eda. Inferring regular languages in polynomial updated time. In Pattern Recognition and Image Analysis, pages 49-60, Singapore, 1992. World Scientific.","DOI":"10.1142\/9789812797902_0004"},{"key":"10.1016\/j.procs.2016.05.318_bib0085","first-page":"105","article-title":"Dynamic construction of finite automata from examples using hill-climbing","author":"Tomita","year":"1982","journal-title":"In Proceedings of the Fourth Annual Conference of the Cognitive Science Society"},{"key":"10.1016\/j.procs.2016.05.318_bib0090","unstructured":"W. Wieczorek. Induction of non-deterministic finite automata on super-computers. In Proceedings of the Eleventh International Conference on Grammatical Inference (ICGI 2012), volume 21 of JMLR Workshop and Conference Proceedings, pages 237-242, 2012."},{"key":"10.1016\/j.procs.2016.05.318_bib0095","doi-asserted-by":"crossref","unstructured":"W. Wieczorek and A. Nowakowski. Grammatical inference in the discovery of generating functions. In Man-Machine Interactions 4, volume 391 of Advances in Intelligent Systems and Computing, pages 627-637. Springer International Publishing, 2016.","DOI":"10.1007\/978-3-319-23437-3_54"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050916306822?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050916306822?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T00:43:37Z","timestamp":1567989817000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050916306822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":19,"alternative-id":["S1877050916306822"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2016.05.318","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On Parallel Induction of Nondeterministic Finite Automata","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2016.05.318","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}