{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T01:22:42Z","timestamp":1648516962062},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2019,3,1]]},"DOI":"10.1587\/transinf.2018fcp0011","type":"journal-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T17:38:47Z","timestamp":1551375527000},"page":"470-482","source":"Crossref","is-referenced-by-count":1,"title":["Exact Learning of Primitive Formal Systems Defining Labeled Ordered Tree Languages via Queries"],"prefix":"10.1587","volume":"E102.D","author":[{"given":"Tomoyuki","family":"UCHIDA","sequence":"first","affiliation":[{"name":"Faculty of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"MATSUMOTO","sequence":"additional","affiliation":[{"name":"Faculty of Science, Tokai University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"SHOUDAI","sequence":"additional","affiliation":[{"name":"Faculty of Contemporary Business, Kyushu International University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"SUZUKI","sequence":"additional","affiliation":[{"name":"Faculty of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuhiro","family":"MIYAHARA","sequence":"additional","affiliation":[{"name":"Faculty of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] G. Rozenberg, ed., Handbook of Graph Grammars and Computing by Graph Transformation: Volume I. Foundations, World Scientific Publishing Co., Inc., River Edge, NJ, USA, 1997.","DOI":"10.1142\/9789812384720"},{"key":"2","unstructured":"[2] T. Uchida, T. Shoudai, and S. Miyano, \u201cParallel algorithms for refutation tree problem on formal graph systems,\u201d IEICE Trans. Inf. & Syst., vol.E78-D, no.2, pp.99-112, 1995."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S. Matsumoto, Y. Hayashi, and T. Shoudai, \u201cPolynomial time inductive inference of regular term tree languages from positive data,\u201d Proc. ALT-97, Springer-Verlag, LNAI, vol.1316, pp.212-227, 1997. 10.1007\/3-540-63577-7_45","DOI":"10.1007\/3-540-63577-7_45"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Y. Suzuki, T. Shoudai, T. Uchida, and T. Miyahara, \u201cOrdered term tree languages which are polynomial time inductively inferable from positive data,\u201d Theoretical Computer Science, vol.350, no.1, pp.63-90, 2006. 10.1016\/j.tcs.2005.10.022","DOI":"10.1016\/j.tcs.2005.10.022"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J. Bj\u00f6rklund and H. Fernau, \u201cLearning tree languages,\u201d in Topics in Grammatical Inference, ed. J. Heinz and J.M. Sempere, ch. 7, pp.173-213, Springer-Verlag, 2016.","DOI":"10.1007\/978-3-662-48395-4"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] D. Angluin, \u201cQueries and concept learning,\u201d Machine Learning, vol.2, no.4, pp.319-342, 1988. 10.1007\/bf00116828","DOI":"10.1007\/BF00116828"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] S. Arikawa, T. Shinohara, and A. Yamamoto, \u201cLearning elementary formal systems,\u201d Theoretical Computer Science, vol.95, no.1, pp.97-113, 1992. 10.1016\/0304-3975(92)90068-q","DOI":"10.1016\/0304-3975(92)90068-Q"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] H. Kato, S. Matsumoto, and T. Miyahara, \u201cLearning of elementary formal systems with two clauses using queries,\u201d IEICE Trans. Inf. & Syst., vol.E92-D, no.2, pp.172-180, 2009. 10.1587\/transinf.e92.d.172","DOI":"10.1587\/transinf.E92.D.172"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] S. Matsumoto, T. Shoudai, T. Uchida, T. Miyahara, and Y. Suzuki, \u201cLearning of finite unions of tree patterns with internal structured variables from queries,\u201d IEICE Trans. Inf. & Syst., vol.E91-D, no.2, pp.222-230, 2008. 10.1093\/ietisy\/e91-d.2.222","DOI":"10.1093\/ietisy\/e91-d.2.222"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] R. Okada, S. Matsumoto, T. Uchida, Y. Suzuki, and T. Shoudai, \u201cExact learning of finite unions of graph patterns from queries,\u201d Proc. ALT 2007, LNAI, vol.4754, pp.298-312, Springer, 2007. 10.1007\/978-3-540-75225-7_25","DOI":"10.1007\/978-3-540-75225-7_25"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] T. Shoudai, S. Matsumoto, and Y. Suzuki, \u201cDistributional learning of regular formal graph system of bounded degree,\u201d Proc. ILP 2016, LNAI, vol.10326, pp.68-80, Springer, 2016. 10.1007\/978-3-319-63342-8_6","DOI":"10.1007\/978-3-319-63342-8_6"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Clark and R. Yoshinaka, \u201cDistributional learning of context-free and multiple context-free grammars,\u201d in Topics in Grammatical Inference, ed. J. Heinz and J.M. Sempere, ch. 6, pp.143-172, Springer-Verlag, 2016.","DOI":"10.1007\/978-3-662-48395-4_6"},{"key":"13","unstructured":"[13] T. Uchida, S. Matsumoto, T. Shoudai, Y. Suzuki, and T. Miyahara, \u201cLearning of primitive formal systems defining labeled ordered tree languages via queries,\u201d Late Breaking Papers of the 27th International Conference on Inductive Logic Programming (LBP-ILP 2017), pp.61-66, CEUR-WS.org, http:\/\/ceur-ws.org\/Vol-2085\/, 2018."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Y. Suzuki, T. Shoudai, T. Uchida, and T. Miyahara, \u201cAn efficient pattern matching algorithm for ordered term tree patterns,\u201d IEICE Trans. Fundamentals, vol.E98-A, no.6, pp.1197-1211, 2015. 10.1587\/transfun.e98.a.1197","DOI":"10.1587\/transfun.E98.A.1197"},{"key":"15","unstructured":"[15] J.W. Lloyd, Foundations of Logic Programming, Springer-Verlag, 1993."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] H. Sakamoto, K. Hirata, and H. Arimura, \u201cLearning elementary formal systems with queries,\u201d Theoretical Computer Science, vol.298, no.1, pp.21-50, 2003. 10.1016\/s0304-3975(02)00417-6","DOI":"10.1016\/S0304-3975(02)00417-6"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/3\/E102.D_2018FCP0011\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T14:06:51Z","timestamp":1574172411000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/3\/E102.D_2018FCP0011\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,1]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2018fcp0011","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,1]]}}}