{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:24Z","timestamp":1759637844399,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030134341"},{"type":"electronic","value":"9783030134358"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-13435-8_19","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T15:18:36Z","timestamp":1550071116000},"page":"259-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Generalized Register Context-Free Grammars"],"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":[[2019,2,14]]},"reference":[{"key":"19_CR1","unstructured":"Benedikt, M., Ley, C., Puppis, G.: What you must remember when processing data words. In: 4th Alberto Mendelzon International Workshop on Foundations of Data Management (2010)"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/1516512.1516515","volume":"56","author":"M 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), 13:1\u201313:48 (2009). \n                      https:\/\/doi.org\/10.1145\/1516512.1516515","journal-title":"J. ACM"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M 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. 12(4), 27:1\u201327:26 (2011). \n                      https:\/\/doi.org\/10.1145\/1970398.1970403","journal-title":"ACM Trans. Comput. Log."},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3) (2014). \n                      https:\/\/doi.org\/10.2168\/LMCS-10(3:4)2014","DOI":"10.2168\/LMCS-10(3:4)2014"},{"issue":"2","key":"19_CR5","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":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"EY Cheng","year":"1998","unstructured":"Cheng, E.Y., 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":"19_CR7","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"S Demri","year":"2009","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), 16:1\u201316:30 (2009). \n                      https:\/\/doi.org\/10.1145\/1507244.1507246","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"19_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."},{"issue":"6","key":"19_CR9","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1017\/S0960129514000322","volume":"26","author":"D Figueira","year":"2016","unstructured":"Figueira, D., Hofman, P., Lasota, S.: Relating timed and register automata. Math. Struct. Comput. Sci. 26(6), 993\u20131021 (2016). \n                      https:\/\/doi.org\/10.1017\/S0960129514000322","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329\u2013363 (1994). \n                      https:\/\/doi.org\/10.1016\/0304-3975(94)90242-9","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2850413","volume":"63","author":"L Libkin","year":"2016","unstructured":"Libkin, L., Martens, W., Vrgo\u010d, D.: Querying graphs with data. J. ACM 63(2), 14:1\u201314:53 (2016). \n                      https:\/\/doi.org\/10.1145\/2850413","journal-title":"J. ACM"},{"issue":"7","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1016\/j.jcss.2015.03.005","volume":"81","author":"L Libkin","year":"2015","unstructured":"Libkin, L., 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":"19_CR13","doi-asserted-by":"publisher","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular path queries on graphs with data. In: 15th International Conference on Database Theory (ICDT 2012), pp. 74\u201385 (2012). \n                      https:\/\/doi.org\/10.1145\/2274576.2274585","DOI":"10.1145\/2274576.2274585"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. In: 19th ACM Symposium on Principles of Database Systems (PODS 2000), pp. 11\u201322 (2000). \n                      https:\/\/doi.org\/10.1145\/335168.335171","DOI":"10.1145\/335168.335171"},{"issue":"3","key":"19_CR15","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."},{"issue":"2","key":"19_CR16","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(2), 297\u2013308 (2000). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(99)00105-X","journal-title":"Theor. Comput. Sci."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-02508-3_22","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2018","author":"R Senda","year":"2018","unstructured":"Senda, R., Takata, Y., Seki, H.: Complexity results on register context-free grammars and register tree automata. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 415\u2013434. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-02508-3_22"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13435-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:47:21Z","timestamp":1558478841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-13435-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134341","9783030134358"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13435-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lata2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}