{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:59:04Z","timestamp":1743127144556,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435867"},{"type":"electronic","value":"9783031435874"}],"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-43587-4_5","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"60-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parsing Unranked Tree Languages, Folded Once"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3692-6994","authenticated-orcid":false,"given":"Martin","family":"Berglund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4696-9787","authenticated-orcid":false,"given":"Henrik","family":"Bj\u00f6rklund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0596-627X","authenticated-orcid":false,"given":"Johanna","family":"Bj\u00f6rklund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Algebraic Discrete Methods 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Berglund, M., Bj\u00f6rklund, H., Bj\u00f6rklund, J., Boiret, A.: Transduction from trees to graphs through folding. Available at SSRN 4291269 (2022)","DOI":"10.2139\/ssrn.4291269"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-60134-2_3","volume-title":"Implementation and Application of Automata","author":"H Bj\u00f6rklund","year":"2017","unstructured":"Bj\u00f6rklund, H., Bj\u00f6rklund, J., Ericson, P.: On the regularity and learnability of ordered DAG languages. In: Carayol, A., Nicaud, C. (eds.) CIAA 2017. LNCS, vol. 10329, pp. 27\u201339. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60134-2_3"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Drewes, F., Ericson, P.: Parsing weighted order-preserving hyperedge replacement grammars. In: 16th Meeting on the Mathematics of Language, MOL 2019, Toronto, Canada, pp. 1\u201311. ACL (2019)","DOI":"10.18653\/v1\/W19-5701"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-98654-8_11","volume-title":"Developments in Language Theory","author":"J Bj\u00f6rklund","year":"2018","unstructured":"Bj\u00f6rklund, J.: Tree-to-graph transductions with scope. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 133\u2013144. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_11"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-030-23679-3_7","volume-title":"Implementation and Application of Automata","author":"J Bj\u00f6rklund","year":"2019","unstructured":"Bj\u00f6rklund, J., Drewes, F., Satta, G.: Z-Automata for compact and direct representation of unranked tree languages. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G. (eds.) CIAA 2019. LNCS, vol. 11601, pp. 83\u201394. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23679-3_7"},{"key":"5_CR7","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets: Version 1. Technical report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology (2001)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/9789812384720_0002","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"F Drewes","year":"1997","unstructured":"Drewes, F., Kreowski, H.J., Habel, A.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, pp. 95\u2013162. World Scientific, River Edge, NJ, USA (1997)"},{"key":"5_CR9","unstructured":"Koller, A.: Semantic construction with graph grammars. In: Proceedings of the 14th International Conference on Computational Semantics, IWCS. London (2015)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-03564-7_6","volume-title":"Algebraic Informatics","author":"D Plump","year":"2009","unstructured":"Plump, D.: The graph programming language GP. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2009. LNCS, vol. 5725, pp. 99\u2013122. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03564-7_6"},{"key":"5_CR11","unstructured":"Quernheim, D., Knight, K.: DAGGER: a toolkit for automata on directed acyclic graphs. In: Proceedings of the 10th International Workshop Finite-State Methods and Natural Language Processing, FSMNLP 2012, pp. 40\u201344. ACL (2012)"},{"key":"5_CR12","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-1-4419-6045-0_16","volume-title":"Managing and Mining Graph Data","author":"L Tang","year":"2010","unstructured":"Tang, L., Liu, H.: Graph mining applications to social network analysis. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data. Advances in Database Systems, vol. 40, pp. 487\u2013513. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0_16"},{"key":"5_CR13","unstructured":"You, J., Leskovec, J., He, K., Xie, S.: Graph structure of neural networks. In: International Conference on Machine Learning, pp. 10881\u201310891. PMLR (2020)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:35:36Z","timestamp":1699911336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_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":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","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":"30","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":"43% - 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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}