{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:35:35Z","timestamp":1648542935159},"reference-count":17,"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":[[2020,3,1]]},"DOI":"10.1587\/transinf.2019fcp0010","type":"journal-article","created":{"date-parts":[[2020,2,29]],"date-time":"2020-02-29T22:11:03Z","timestamp":1583014263000},"page":"540-548","source":"Crossref","is-referenced-by-count":2,"title":["Generalized Register Context-Free Grammars"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Ryoma","family":"SENDA","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"TAKATA","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Kochi University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"SEKI","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] M. Benedikt, C. Ley, and G. Puppis, \u201cWhat you must remember when processing data words,\u201d 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] M. Boja\u0144czyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin, \u201cTwo-variable logic on data words,\u201d ACM Trans. Comput. Logic, vol.12, no.4, pp.1-26, July 2011. 10.1145\/1970398.1970403","DOI":"10.1145\/1970398.1970403"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Boja\u0144czyk, B. Klin, and S. Lasota, \u201cAutomata theory in nominal sets,\u201d Log. Meth. Comput. Sci., vol.10, no.3, Aug. 2014. 10.2168\/lmcs-10(3:4)2014","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] P. Bouyer, \u201cA logical characterization of data languages,\u201d Inform. Process. Lett., vol.84, no.2, pp.75-85, Oct. 2002. 10.1016\/s0020-0190(02)00229-6","DOI":"10.1016\/S0020-0190(02)00229-6"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] E.Y.C. Cheng and M. Kaminski, \u201cContext-free languages over infinite alphabets,\u201d Acta Inform., vol.35, no.3, pp.245-267, March 1998. 10.1007\/s002360050120","DOI":"10.1007\/s002360050120"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] S. Demri and R. Lazi\u0107, \u201cLTL with the freeze quantifier and register automata,\u201d ACM Trans. Comput. Logic, vol.10, no.3, pp.1-30, April 2009. 10.1145\/1507244.1507246","DOI":"10.1145\/1507244.1507246"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] S. Demri, R. Lazi\u0107, and D. Nowak, \u201cOn the freeze quantifier in constraint LTL: Decidability and complexity,\u201d Inform. Comput., vol.205, no.1, pp.2-24, Jan. 2007. 10.1016\/j.ic.2006.08.003","DOI":"10.1016\/j.ic.2006.08.003"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] D. Figueira, P. Hofman, and S. Lasota, \u201cRelating timed and register automata,\u201d Math. Struct. Comp. Sci., vol.26, no.6, pp.993-1021, Sept. 2016. 10.1017\/s0960129514000322","DOI":"10.1017\/S0960129514000322"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] M. Kaminski and N. Francez, \u201cFinite-memory automata,\u201d Theor. Comput. Sci., vol.134, no.2, pp.329-363, 1994. 10.1016\/0304-3975(94)90242-9","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] L. Libkin, W. Martens, and D. Vrgo\u010d, \u201cQuerying graphs with data,\u201d J. ACM, vol.63, no.2, pp.1-53, March 2016. 10.1145\/2850413","DOI":"10.1145\/2850413"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] L. Libkin, T. Tan, and D. Vrgo\u010d, \u201cRegular expressions for data words,\u201d J. Comput. Syst. Sci., vol.81, no.7, pp.1278-1297, 2015. 10.1016\/j.jcss.2015.03.005","DOI":"10.1016\/j.jcss.2015.03.005"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] L. Libkin and D. Vrgo\u010d, \u201cRegular path queries on graphs with data,\u201d Proc. 15th International Conference on Database Theory (ICDT '12), pp.74-85, 2012. 10.1145\/2274576.2274585","DOI":"10.1145\/2274576.2274585"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] T. Milo, D. Suciu, and V. Vianu, \u201cTypechecking for XML transformers,\u201d Proc. 19th ACM Symposium on Principles of Database Systems (PODS 2000), pp.11-22, 2000. 10.1145\/335168.335171","DOI":"10.1145\/335168.335171"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] F. Neven, T. Schwentick, and V. Vianu, \u201cFinite state machines for strings over infinite alphabets,\u201d ACM Trans. Comput. Logic, vol.5, no.3, pp.403-435, July 2004. 10.1145\/1013560.1013562","DOI":"10.1145\/1013560.1013562"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] H. Sakamoto and D. Ikeda, \u201cIntractability of decision problems for finite-memory automata,\u201d Theor. Comput. Sci., vol.231, no.2, pp.297-308, 2000. 10.1016\/s0304-3975(99)00105-x","DOI":"10.1016\/S0304-3975(99)00105-X"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] R. Senda, Y. Takata, and H. Seki, \u201cComplexity results on register context-free grammars and register tree automata,\u201d Theoretical Aspects of Computing-ICTAC 2018, Lecture Notes in Computer Science, vol.11187, pp.415-434, Springer International Publishing, Cham, 2018. 10.1007\/978-3-030-02508-3_22","DOI":"10.1007\/978-3-030-02508-3_22"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] R. Senda, Y. Takata, and H. Seki, \u201cGeneralized register context-free grammars,\u201d Language and Automata Theory and Applications, Lecture Notes in Computer Science, vol.11417, pp.259-271, Springer International Publishing, Cham, 2019. 10.1007\/978-3-030-13435-8_19","DOI":"10.1007\/978-3-030-13435-8_19"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/3\/E103.D_2019FCP0010\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T03:27:05Z","timestamp":1583551625000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/3\/E103.D_2019FCP0010\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,1]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019fcp0010","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,1]]}}}