{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:28Z","timestamp":1759638268345,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030025076"},{"type":"electronic","value":"9783030025083"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-02508-3_22","type":"book-chapter","created":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T14:22:47Z","timestamp":1539440567000},"page":"415-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Complexity Results on Register Context-Free Grammars and Register Tree Automata"],"prefix":"10.1007","author":[{"given":"Ryoma","family":"Senda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Takata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"22_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516515","volume":"56","author":"Mikoaj Boja\u0144czyk","year":"2009","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. J. ACM 56(3), Article no. 13 (2009). \n                      https:\/\/doi.org\/10.1145\/1516512.1516515\n                      \n                    .","journal-title":"Journal of the ACM"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970398.1970403","volume":"12","author":"Miko\u0142aj Boja\u0144czyk","year":"2011","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 1(4), Article no. 27 (2011). \n                      https:\/\/doi.org\/10.1145\/1970398.1970403","journal-title":"ACM Transactions on Computational Logic"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/s0020-0190(02)00229-6","volume":"84","author":"P Bouyer","year":"2002","unstructured":"Bouyer, P.: A logical characterization of data languages. Inf. Process. Lett. 84(2), 75\u201385 (2002). \n                      https:\/\/doi.org\/10.1016\/s0020-0190(02)00229-6","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114\u2013133 (1981). \n                      https:\/\/doi.org\/10.1145\/322234.322243","journal-title":"J. ACM"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"EYC Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf. 35(3), 245\u2013267 (1998). \n                      https:\/\/doi.org\/10.1007\/s002360050120","journal-title":"Acta Inf."},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"St\u00e9phane Demri","year":"2009","unstructured":"Demri, S., Lazi\u0107, R.: LTL with freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), Article no. 16 (2009). \n                      https:\/\/doi.org\/10.1145\/1507244.1507246","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ic.2006.08.003","volume":"205","author":"S Demri","year":"2007","unstructured":"Demri, S., Lazi\u0107, R., Nowak, D.: On the freeze quantifier in constraint LTL: decidability and complexity. Inf. Comput. 205(1), 2\u201324 (2007). \n                      https:\/\/doi.org\/10.1016\/j.ic.2006.08.003","journal-title":"Inf. Comput."},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Figueira, D.: Forward-XPath and extended register automata on data-trees. In: Proceedings of 13th International Conference on Database Theory, ICDT 2010, Lausanne, March 2010. ACM International Conference Proceedings Series, pp. 231\u2013241. ACM Press, New York (2010). \n                      https:\/\/doi.org\/10.1145\/1804669.1804699","DOI":"10.1145\/1804669.1804699"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Figueira, D.: Alternating register automata on finite data words and trees. Log. Methods Comput. Sci. 8(1), Article no. 22 (2012). \n                      https:\/\/doi.org\/10.2168\/lmcs-8(1:22)2012","DOI":"10.2168\/lmcs-8(1:22)2012"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Figueira, D., Segoufin, L.: Bottom-up automata on data trees and vertical XPath. In: Schwentick, T., D\u00fcrr, C. (eds.) Proceedings of 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, Dortmund, March 2011. Leibniz International Proceedings in Information, vol. 9, pp. 93\u2013104. Dagstuhl Publishing, Saarbr\u00fccken\/Wadern (2011). \n                      https:\/\/doi.org\/10.4230\/lipics.stacs.2011.93","DOI":"10.4230\/lipics.stacs.2011.93"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R.: Alternation-free modal mu-calculus for data trees. In: Proceedings of 22nd IEEE Symposium on Logic in Computer Science, LICS 2007, Wroclaw, July 2007, pp. 131\u2013140. IEEE CS Press, Washington, DC (2007). \n                      https:\/\/doi.org\/10.1109\/lics.2007.11","DOI":"10.1109\/lics.2007.11"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1111\/j.1467-8640.1994.tb00008.x","volume":"10","author":"Y Kaji","year":"1994","unstructured":"Kaji, Y., Nakanishi, R., Seki, H., Kasami, T.: The computational complexity of the universal recognition problem for parallel multiple context-free grammars. Comput. Intell. 10(4), 440\u2013452 (1994). \n                      https:\/\/doi.org\/10.1111\/j.1467-8640.1994.tb00008.x","journal-title":"Comput. Intell."},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Franz, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 322\u2013363 (1994). \n                      https:\/\/doi.org\/10.1016\/0304-3975(94)90242-9","journal-title":"Theor. Comput. Sci."},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-78127-1_21","volume-title":"Pillars of Computer Science","author":"M Kaminski","year":"2008","unstructured":"Kaminski, M., Tan, T.: Tree automata over infinite alphabets. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 386\u2013423. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-78127-1_21"},{"key":"22_CR16","series-title":"Texts in Theoretical Computer Science: An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. TTCS. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-662-07003-1"},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2850413","volume":"63","author":"Leonid Libkin","year":"2016","unstructured":"Libkin, L., Martens, W., Vrgo\u010d, D.: Querying graphs with data. J. ACM 63(2), Article no. 14 (2016). \n                      https:\/\/doi.org\/10.1145\/2850413","journal-title":"Journal of the ACM"},{"issue":"7","key":"22_CR18","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1016\/j.jcss.2015.03.005","volume":"81","author":"T Libkin","year":"2015","unstructured":"Libkin, T., Tan, T., Vrgo\u010d, D.: Regular expressions for data words. J. Comput. Syst. Sci. 81(7), 1278\u20131297 (2015). \n                      https:\/\/doi.org\/10.1016\/j.jcss.2015.03.005","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR19","doi-asserted-by":"publisher","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular path queries on graphs with data. In: Proceedings of 15th International Conference on Database Theory, ICDT 2012, Berlin, March 2012, pp. 74\u201385. ACM Press, New York (2012). \n                      https:\/\/doi.org\/10.1145\/2274576.2274585","DOI":"10.1145\/2274576.2274585"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"Milo, T., Suciu, D., Vianu, V.: Type checking for XML transformers. In: Proceedings of 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2000, Dallas, TX, May 2000, pp. 11\u201322. ACM Press, New York (2000). \n                      https:\/\/doi.org\/10.1145\/335168.335171","DOI":"10.1145\/335168.335171"},{"issue":"3","key":"22_CR21","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3), 403\u2013435 (2004). \n                      https:\/\/doi.org\/10.1145\/1013560.1013562","journal-title":"ACM Trans. Comput. Log."},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/s0304-3975(99)00105-x","volume":"231","author":"H Sakamoto","year":"2000","unstructured":"Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231, 297\u2013308 (2000). \n                      https:\/\/doi.org\/10.1016\/s0304-3975(99)00105-x","journal-title":"Theor. Comput. Sci."},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41\u201357. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11874683_3"},{"key":"22_CR24","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2013","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage Learning, Boston (2013)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02508-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T02:49:09Z","timestamp":1583203749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02508-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030025076","9783030025083"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02508-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"15 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stellenbosch","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"South Africa","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ictac.org.za\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}