{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:16:49Z","timestamp":1743149809057,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031294754"},{"type":"electronic","value":"9783031294761"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-29476-1_5","type":"book-chapter","created":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T11:03:45Z","timestamp":1679655825000},"page":"59-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending Visibly Pushdown Automata over Multi-matching Nested Relations"],"prefix":"10.1007","author":[{"given":"Jin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yeqiu","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Haiyang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wensheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,25]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM (JACM) 56(3), 1\u201343 (2009)","journal-title":"J. ACM (JACM)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"5_CR3","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Pearson Education, London (2000). ISBN 0-201-44124-1","edition":"2"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: Proceedings of the 16th International Conference on World Wide Web (WWW 2007), 1053C1062 (2007)","DOI":"10.1145\/1242572.1242714"},{"key":"5_CR5","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., et al.: Early nested word automata for XPath query answering on XML streams. Theor. Comput. Sci. 578, 100\u2013125 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Alur, R.: Instrumenting C programs with nested word monitors. In: International SPIN Workshop on Model Checking of Software, pp. 279\u2013283 (2007)","DOI":"10.1007\/978-3-540-73370-6_20"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Driscoll, E., Thakur, A., Reps, T.: OpenNWA: a nested-word automaton library. In: International Conference on Computer Aided Verification, pp. 665\u2013671 (2012)","DOI":"10.1007\/978-3-642-31424-7_47"},{"key":"5_CR8","unstructured":"Watson, B.W.: Implementing and using finite automata toolkits. In: Extended Finite State Models of Language, pp. 19\u201336. Cambridge University Press, New York (1999)"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1012291501330","volume":"4","author":"G van Noord","year":"2001","unstructured":"van Noord, G., Gerdemann, D.: Finite state transducers with predicates and identities. Grammars 4(3), 263\u2013286 (2001)","journal-title":"Grammars"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Alur, R.: Symbolic visibly pushdown automata. In: International Conference on Computer Aided Verification (CAV 2014), pp. 209\u2013225 (2014)","DOI":"10.1007\/978-3-319-08867-9_14"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Margus, V., Pieter, H., Benjamin, L., et al.: Symbolic finite state transducers: algorithms and applications. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2012), pp. 137\u2013150 (2012)","DOI":"10.1145\/2103656.2103674"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Liu, J.. Duan, Z., Tian, C.: Transforming multi-matching nested traceable automata to multi-matching nested expressions. In: Proceedings of the 14th International Conference on Combinatorial Optimization and Applications (COCOA 2020), pp. 320\u2013333 (2020)","DOI":"10.1007\/978-3-030-64843-5_22"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2020.12.004","volume":"854","author":"J Liu","year":"2021","unstructured":"Liu, J., Duan, Z., Tian, C.: Multi-matching nested relations. Theor. Comput. Sci. 854, 77\u201393 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR14","first-page":"137","volume":"31","author":"J Liu","year":"2022","unstructured":"Liu, J., Duan, Z., Tian, C.: Multi-matching nested languages. Chin. J. Electron. 31(1), 137\u2013145 (2022)","journal-title":"Chin. J. Electron."}],"container-title":["Lecture Notes in Computer Science","Structured Object-Oriented Formal Language and Method"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29476-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T23:37:52Z","timestamp":1729121872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29476-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031294754","9783031294761"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29476-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFL+MSVL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Structured Object-Oriented Formal Language and Method","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"26","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":"12","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":"46% - 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":"2","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy to use as a whole. Almost everything in the system is good.","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)"}}]}}