{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:48Z","timestamp":1760202828444},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030236786"},{"type":"electronic","value":"9783030236793"}],"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-23679-3_7","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:02:38Z","timestamp":1562526158000},"page":"83-94","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Z-Automata for Compact and Direct Representation of Unranked Tree Languages"],"prefix":"10.1007","author":[{"given":"Johanna","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Drewes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Satta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"7_CR1","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets: version 1. Techcial report HKUST-TCSC-2001-0, The Hong Kong University of Science and Technology (2001). \n                      http:\/\/repository.ust.hk\/ir\/Record\/1783.1-738"},{"key":"7_CR2","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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-25979-4_8"},{"key":"7_CR3","unstructured":"Comon, H., et al.: Tree automata techniques and applications. \n                      http:\/\/www.grappa.univ-lille3.fr\/tata\n                      \n                    . Accessed 12 Oct 2007"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00224-009-9224-4","volume":"48","author":"M Droste","year":"2011","unstructured":"Droste, M., Vogler, H.: Weighted logics for unranked tree automata. Theory Comput. Syst. 48(1), 23\u201347 (2011). \n                      https:\/\/doi.org\/10.1007\/s00224-009-9224-4","journal-title":"Theory Comput. Syst."},{"key":"7_CR5","volume-title":"Tree Automata","author":"F G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984). \n                      https:\/\/arxiv.org\/abs\/1509.06233"},{"issue":"37","key":"7_CR6","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1016\/j.tcs.2009.03.022","volume":"410","author":"Johanna H\u00f6gberg","year":"2009","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. Theor. Comput. Sci. 410(37), 3539\u20133552 (2009). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2009.03.022\n                      \n                    . Preliminary version. In: CIAA 2007","journal-title":"Theoretical Computer Science"},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.2200\/S00169ED1V01Y200901HLT002","volume-title":"Dependency Parsing","author":"S K\u00fcbler","year":"2009","unstructured":"K\u00fcbler, S., McDonald, R., Nivre, J.: Dependency Parsing. Morgan and Claypool Publishers, New York (2009). \n                      https:\/\/doi.org\/10.2200\/S00169ED1V01Y200901HLT002"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-2(3:2)2006","volume":"2","author":"L Libkin","year":"2006","unstructured":"Libkin, L.: Logics for unranked trees: an overview. Log. Methods Comput. Sci. 2(3), 1\u201331 (2006). \n                      https:\/\/doi.org\/10.2168\/LMCS-2(3:2)2006","journal-title":"Log. Methods Comput. Sci."},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/070699160","volume":"39","author":"A Maletti","year":"2009","unstructured":"Maletti, A., Graehl, J., Hopkins, M., Knight, K.: The power of extended top-down tree transducers. SIAM J. Comput. 39(2), 410\u2013430 (2009). \n                      https:\/\/doi.org\/10.1137\/070699160","journal-title":"SIAM J. Comput."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11601524_15","volume-title":"Database Programming Languages","author":"W Martens","year":"2005","unstructured":"Martens, W., Niehren, J.: Minimizing tree automata for unranked trees. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 232\u2013246. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11601524_15"},{"issue":"4","key":"7_CR11","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. System Sci. 73(4), 550\u2013583 (2007). \n                      https:\/\/doi.org\/10.1016\/j.jcss.2006.10.021","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23679-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:11:16Z","timestamp":1562526676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23679-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236786","9783030236793"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23679-3_7","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":"26 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"22 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","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":"wia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/ciaa2019\/","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":"28","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":"17","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":"2","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":"61% - 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.89","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":"2.625","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)"}}]}}