{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:27:51Z","timestamp":1742945271767,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_12","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"169-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2696-7303","authenticated-orcid":false,"given":"Iovka","family":"Boneva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2611-8950","authenticated-orcid":false,"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6802-5480","authenticated-orcid":false,"given":"Momar","family":"Sakho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Alur, R.: Marrying words and trees. In: 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 233\u2013242. ACM Press (2007). \nhttps:\/\/doi.org\/10.1145\/1265530.1265564","DOI":"10.1145\/1265530.1265564"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming","author":"R Alur","year":"2005","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1102\u20131114. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11523468_89"},{"key":"12_CR3","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: 36th ACM Symposium on Theory of Computing, pp. 202\u2013211. ACM Press (2004). \nhttp:\/\/portal.acm.org\/citation.cfm?coll=GUIDE&dl=GUIDE&id=1007390"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Jeffrey, A., Ley-Wild, R.: Stream firewalling of XML constraints. In: ACM SIGMOD International Conference on Management of Data, pp. 487\u2013498. ACM Press (2008)","DOI":"10.1145\/1376616.1376667"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00236-013-0190-6","volume":"51","author":"L Bozzelli","year":"2014","unstructured":"Bozzelli, L., S\u00e1nchez, C.: Visibly rational expressions. Acta Inf. 51(1), 25\u201349 (2014). \nhttps:\/\/doi.org\/10.1007\/s00236-013-0190-6","journal-title":"Acta Inf."},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 120(2), 197\u2013213 (1993). \nhttps:\/\/doi.org\/10.1016\/0304-3975(93)90287-4","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 142(2), 182\u2013206 (1998)","journal-title":"Inf. Comput."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-25979-4_8","volume-title":"Rewriting Techniques and Applications","author":"J Carme","year":"2004","unstructured":"Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 105\u2013118. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-25979-4_8\n\n. \nhttp:\/\/www.ps.uni-sb.de\/Papers\/abstracts\/stepwise.html"},{"issue":"11","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1016\/j.ic.2009.03.003","volume":"207","author":"J Champav\u00e8re","year":"2009","unstructured":"Champav\u00e8re, J., Gilleron, R., Lemay, A., Niehren, J.: Efficient inclusion checking for deterministic tree automata and XML schemas. Inf. Comput. 207(11), 1181\u20131208 (2009). \nhttps:\/\/doi.org\/10.1016\/j.ic.2009.03.003","journal-title":"Inf. Comput."},{"key":"12_CR10","unstructured":"Comon, H., et al.: Tree automata techniques and applications, October 2007. \nhttp:\/\/tata.gforge.inria.fr\n\n. Accessed 1997"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-08867-9_14","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2014","unstructured":"D\u2019Antoni, L., Alur, R.: Symbolic visibly pushdown automata. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 209\u2013225. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08867-9_14"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2015.01.017","volume":"578","author":"D Debarbieux","year":"2015","unstructured":"Debarbieux, D., Gauwin, O., Niehren, J., Sebastian, T., Zergaoui, M.: Early nested word automata for XPath query answering on XML streams. Theor. Comput. Sci. 578, 100\u2013125 (2015). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2015.01.017","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18(2), 194\u2013211 (1979). \nhttps:\/\/doi.org\/10.1016\/0022-0000(79)90046-1","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR14","unstructured":"Franceschet, M.: XPathMark performance test. \nhttps:\/\/users.dimi.uniud.it\/~massimo.franceschet\/xpathmark\/PTbench.html\n\n. Accessed 30 Mar 2020"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-22256-6_2","volume-title":"Implementation and Application of Automata","author":"O Gauwin","year":"2011","unstructured":"Gauwin, O., Niehren, J.: Streamable fragments of forward XPath. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 3\u201315. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22256-6_2"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-03409-1_12","volume-title":"Fundamentals of Computation Theory","author":"O Gauwin","year":"2009","unstructured":"Gauwin, O., Niehren, J., Tison, S.: Earliest query answering for deterministic nested word automata. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 121\u2013132. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03409-1_12\n\n. \nhttp:\/\/hal.inria.fr\/inria-00390236\/en"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: The complexity of XPath query evaluation. In: 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 179\u2013190 (2003)","DOI":"10.1145\/773153.773171"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Grez, A., Riveros, C., Ugarte, M.: A formal framework for complex event processing. In: Barcel\u00f3, P., Calautti, M. (eds.) 22nd International Conference on Database Theory, ICDT 2019. LIPIcs, Lisbon, Portugal, 26\u201328 March 2019, vol. 127, pp. 5:1\u20135:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2019). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2019.5","DOI":"10.4230\/LIPIcs.ICDT.2019.5"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/767193.767195","volume":"3","author":"H Hosoya","year":"2003","unstructured":"Hosoya, H., Pierce, B.C.: XDuce: a statically typed XML processing language. ACM Trans. Internet Technol. 3(2), 117\u2013148 (2003). \nhttps:\/\/doi.org\/10.1145\/767193.767195","journal-title":"ACM Trans. Internet Technol."},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.jcss.2006.10.021","volume":"73","author":"W Martens","year":"2007","unstructured":"Martens, W., Niehren, J.: On the minimization of XML-schemas and tree automata for unranked trees. J. Comput. Syst. Sci. 73(4), 550\u2013583 (2007). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2006.10.021\n\n. \nhttps:\/\/hal.inria.fr\/inria-00088406\n\n. Special issue of DBPL 05","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Mozafari, B., Zeng, K., Zaniolo, C.: From regular expressions to nested words: unifying languages and query execution for relational and XML sequences. PVLDB 3(1), 150\u2013161 (2010). \nhttps:\/\/doi.org\/10.14778\/1920841.1920865\n\n. \nhttp:\/\/www.vldb.org\/pvldb\/vldb2010\/pvldb_vol3\/R13.pdf","DOI":"10.14778\/1920841.1920865"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Mozafari, B., Zeng, K., Zaniolo, C.: High-performance complex event processing over XML streams. In: Candan, K.S., et al. (eds.) SIGMOD Conference, pp. 253\u2013264. ACM (2012). \nhttps:\/\/doi.org\/10.1145\/2213836.2213866","DOI":"10.1145\/2213836.2213866"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-49382-2_12","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A Neumann","year":"1998","unstructured":"Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. In: Arvind, V., Ramanujam, S. (eds.) FSTTCS 1998. LNCS, vol. 1530, pp. 134\u2013145. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/978-3-540-49382-2_12"},{"issue":"7","key":"12_CR24","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1109\/TKDE.2007.1063","volume":"19","author":"D Olteanu","year":"2007","unstructured":"Olteanu, D.: SPEX: streamed and progressive evaluation of XPath. IEEE Trans. Know. Data Eng. 19(7), 934\u2013949 (2007). \nhttps:\/\/doi.org\/10.1109\/TKDE.2007.1063","journal-title":"IEEE Trans. Know. Data Eng."},{"key":"12_CR25","unstructured":"Pitcher, C.: Visibly pushdown expression effects for XML stream processing. In: PlanX (2005)"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"JW Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of automata theory. J. Comput. Syst. Sci. 1, 317\u2013322 (1967)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:05:57Z","timestamp":1592780757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","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":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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 (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}