{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T04:40:54Z","timestamp":1677904854880},"reference-count":13,"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":[[2023,3,1]]},"DOI":"10.1587\/transinf.2022fcp0004","type":"journal-article","created":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T22:20:18Z","timestamp":1677622818000},"page":"284-293","source":"Crossref","is-referenced-by-count":0,"title":["Pumping Lemmas for Languages Expressed by Computational Models with Registers"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Rindo","family":"NAKANISHI","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}]},{"given":"Yoshiaki","family":"TAKATA","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Kochi University of Technology"}]},{"given":"Hiroyuki","family":"SEKI","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] M. Boja\u0144czyk, B. Klin, and S. Lasota, \u201cAutomata theory in nominal sets,\u201d Logical Methods In Computer Science, vol.10, no.3, pp.1-44, 2014. 10.2168\/lmcs-10(3:4)2014","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] P. Bouyer, \u201cA logical characterization of data languages,\u201d Inf. Process. Lett., vol.84, no.2, pp.75-85, 2002. 10.1016\/s0020-0190(02)00229-6","DOI":"10.1016\/S0020-0190(02)00229-6"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Cassel, F. Howar, B. Jonsson, and B. Steffen, \u201cActive learning for extended finite state machines,\u201d Formal Aspects of Computing, vol.28, pp.233-263, 2016. 10.1007\/s00165-016-0355-5","DOI":"10.1007\/s00165-016-0355-5"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] E.Y.C. Cheng and M. Kaminski, \u201cContext-free languages over infinite alphabets,\u201d Acta Informatica, vol.35, pp.245-267, 1998. 10.1007\/s002360050120","DOI":"10.1007\/s002360050120"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S. Demri and R. Lazi\u0107, \u201cLTL with the freeze quantifier and register automata,\u201d ACM Transactions on Computational Logic, vol.10, no.3, pp.1-30, 2009. 10.1145\/1507244.1507246","DOI":"10.1145\/1507244.1507246"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] M. Kaminski and N. Francez, \u201cFinite-memory automata,\u201d Theoretical Computer Science, vol.134, no.2, pp.329-363, 1994. 10.1016\/0304-3975(94)90242-9","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Kaminski and T. Tan, Tree automata over infinite alphabets, Pillars of Computer Science 2008, LNCS 4800, pp.386-423.","DOI":"10.1007\/978-3-540-78127-1_21"},{"key":"8","unstructured":"[8] B. Klin, A pumping lemma for automata with atoms, March 26, 2014. https:\/\/atoms.mimuw.edu.pl\/?p=43, accessed July 21, 2022."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] L. Libkin, T. Tan, and D. Vrgo\u010d, \u201cRegular expressions for data words,\u201d Journal of Computer and System Sciences, vol.81, no.7, pp.1278-1297, 2015. 10.1016\/j.jcss.2015.03.005","DOI":"10.1016\/j.jcss.2015.03.005"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] F. Neven, T. Schwentick, and V. Vianu, \u201cFinite state machines for strings over infinite alphabets,\u201d ACM Trans. on Computational Logic, vol.5, no.3, pp.403-435, 2004. 10.1145\/1013560.1013562","DOI":"10.1145\/1013560.1013562"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] H. Sakamoto and D. Ikeda, \u201cIntractability of decision problems for finite-memory automata,\u201d Theoretical Computer Science, vol.231, no.2, pp.297-308, 2000. 10.1016\/s0304-3975(99)00105-x","DOI":"10.1016\/S0304-3975(99)00105-X"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] R. Senda, Y. Takata, and H. Seki, Complexity results on register context-free grammars and register tree automata, International Colloquium on Theoretical Aspects of Computing (ICTAC 2018), LNCS 11187, pp.415-434, 2018. 10.1007\/978-3-030-02508-3_22","DOI":"10.1007\/978-3-030-02508-3_22"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] R. Senda, Y. Takata, and H. Seki, \u201cGeneralized Register Context-Free Grammars,\u201d 13th International Conference on Language and Automata Theory and Applications (LATA 2019), LNCS 11417, pp.259-271, 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\/E106.D\/3\/E106.D_2022FCP0004\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T04:15:51Z","timestamp":1677903351000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/3\/E106.D_2022FCP0004\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022fcp0004","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"article-number":"2022FCP0004"}}