{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:09:36Z","timestamp":1743026976860,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030815073"},{"type":"electronic","value":"9783030815080"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-81508-0_6","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"66-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compositions of Constant Weighted Extended Tree Transducers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2282-0723","authenticated-orcid":false,"given":"Malte","family":"Blattmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3202-0498","authenticated-orcid":false,"given":"Andreas","family":"Maletti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,6]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst \u2013 a general and efficient weighted finite-state transducer library. In: Proceedings of 12th International Conference Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 4783, pp. 11\u201323. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-76336-9_3","DOI":"10.1007\/978-3-540-76336-9_3"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(82)90098-6","volume":"20","author":"A Arnold","year":"1982","unstructured":"Arnold, A., Dauchet, M.: Morphismes et bimorphismes d\u2019arbres. Theor. Comput. Sci. 20(4), 33\u201393 (1982). https:\/\/doi.org\/10.1016\/0304-3975(82)90098-6","journal-title":"Theor. Comput. Sci."},{"key":"6_CR3","unstructured":"Dauchet, M.: Transductions inversibles de for\u00eats. Th\u00e8se 3\u00e8me cycle, Universit\u00e9 de Lille (1975). http:\/\/ori.univ-lille1.fr\/notice\/view\/univ-lille1-ori-70098"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theory 10, 289\u2013303 (1977). https:\/\/doi.org\/10.1007\/BF01683280","journal-title":"Math. Syst. Theory"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Engelfriet, J., F\u00fcl\u00f6p, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Comb. 7(1), 11\u201370 (2002). https:\/\/doi.org\/10.25596\/jalc-2002-011","DOI":"10.25596\/jalc-2002-011"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-23679-3_11","volume-title":"Implementation and Application of Automata","author":"Z F\u00fcl\u00f6p","year":"2019","unstructured":"F\u00fcl\u00f6p, Z., Maletti, A.: Composition closure of linear weighted extended top-down tree transducers. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G. (eds.) CIAA 2019. LNCS, vol. 11601, pp. 133\u2013145. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23679-3_11"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00224-003-1072-z","volume":"36","author":"Z F\u00fcl\u00f6p","year":"2003","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Tree series transformations that respect copying. Theory Comput. Syst. 36(3), 247\u2013293 (2003). https:\/\/doi.org\/10.1007\/s00224-003-1072-z","journal-title":"Theory Comput. Syst."},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, chap. 9, pp. 313\u2013403. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5_9","DOI":"10.1007\/978-3-642-01492-5_9"},{"key":"6_CR9","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest 2nd revision (1984). https:\/\/arxiv.org\/abs\/1509.06233"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-59126-6_1","volume-title":"Handbook of Formal Languages","author":"F G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 1\u201368. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_1"},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9333-5","author":"JS Golan","year":"1999","unstructured":"Golan, J.S.: Semirings and their applications. Kluwer Acad. Publishers (1999). https:\/\/doi.org\/10.1007\/978-94-015-9333-5","journal-title":"Kluwer Acad. Publishers"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1162\/coli.2008.07-051-R2-03-57","volume":"34","author":"J Graehl","year":"2008","unstructured":"Graehl, J., Knight, K., May, J.: Training tree transducers. Comput. Linguist. 34(3), 391\u2013427 (2008). https:\/\/doi.org\/10.1162\/coli.2008.07-051-R2-03-57","journal-title":"Comput. Linguist."},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Hanneforth, T., Maletti, A., Quernheim, D.: Pushing for weighted tree automata. Logical Meth. Comput. Sci. 14(1:5), 1\u201316 (2018). https:\/\/doi.org\/10.23638\/LMCS-14(1:5)","DOI":"10.23638\/LMCS-14(1:5)"},{"key":"6_CR14","doi-asserted-by":"publisher","DOI":"10.1142\/3903","author":"U Hebisch","year":"1998","unstructured":"Hebisch, U., Weinert, H.J.: Semirings \u2013 algebraic theory and applications in computer science. World Sci. Publishing (1998). https:\/\/doi.org\/10.1142\/3903","journal-title":"World Sci. Publishing"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Koehn, P.: Statistical Machine Translation. Cambridge University Press (2010). https:\/\/doi.org\/10.1017\/CBO9780511815829","DOI":"10.1017\/CBO9780511815829"},{"key":"6_CR16","unstructured":"Kuich, W.: Tree transducers and formal tree series. Acta Cybernetica 14(1), 135\u2013149 (1999). https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/view\/3516"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-24897-9_13","volume-title":"Algebraic Foundations in Computer Science","author":"A Lagoutte","year":"2011","unstructured":"Lagoutte, A., Maletti, A.: Survey: weighted extended top-down tree transducers part III \u2014 composition. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 272\u2013308. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24897-9_13"},{"issue":"9\u201310","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1016\/j.ic.2008.03.019","volume":"206","author":"A Maletti","year":"2008","unstructured":"Maletti, A.: Compositions of extended top-down tree transducers. Inf. Comput. 206(9\u201310), 1187\u20131196 (2008). https:\/\/doi.org\/10.1016\/j.ic.2008.03.019","journal-title":"Inf. Comput."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Maletti, A.: Survey: weighted extended top-down tree transducers \u2013 part I: basics and expressive power. Acta Cybernetica 20(2), 223\u2013250 (2011). https:\/\/doi.org\/10.14232\/actacyb.20.2.2011.2","DOI":"10.14232\/actacyb.20.2.2011.2"},{"issue":"2","key":"6_CR20","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). https:\/\/doi.org\/10.1137\/070699160","journal-title":"SIAM J. Comput."},{"key":"6_CR21","unstructured":"May, J., Knight, K., Vogler, H.: Efficient inference through cascades of weighted tree transducers. In: Proceedings 48th Annual Meeting Association for Computational Linguistics, pp. 1058\u20131066. Association for Computational Linguistics (2010). https:\/\/www.aclweb.org\/anthology\/P10-1108"},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/csla.2001.0184","volume":"16","author":"M Mohri","year":"2002","unstructured":"Mohri, M., Pereira, F., Riley, M.: Weighted finite-state transducers in speech recognition. Comput. Speech Lang. 16(1), 69\u201388 (2002). https:\/\/doi.org\/10.1006\/csla.2001.0184","journal-title":"Comput. Speech Lang."},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"WC Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theory 4(3), 257\u2013287 (1970). https:\/\/doi.org\/10.1007\/BF01695769","journal-title":"Math. Syst. Theory"},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","volume":"4","author":"JW Thatcher","year":"1970","unstructured":"Thatcher, J.W.: Generalized$$^2$$ sequential machine maps. J. Comput. Syst. Sci. 4(4), 339\u2013367 (1970). https:\/\/doi.org\/10.1016\/S0022-0000(70)80017-4","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR25","unstructured":"Thatcher, J.W.: Tree automata: an informal survey. In: Aho, A.V. (ed.) Currents in the Theory of Computing, chap. 4, pp. 143\u2013172. Prentice Hall (1973)"},{"key":"6_CR26","unstructured":"Wang, H.: On characters of semirings. Houston J. Math. 23(3), 391\u2013405 (1997). https:\/\/www.math.uh.edu\/~hjm\/restricted\/archive\/v023n3\/0391WANG.pdf"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Yamada, K., Knight, K.: A decoder for syntax-based statistical MT. In: Proceedings of 40th Annual Meeting Association for Computational Linguistics, pp. 303\u2013310. Association for Computational Linguistics (2002). https:\/\/doi.org\/10.3115\/1073083.1073134","DOI":"10.3115\/1073083.1073134"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81508-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:33:14Z","timestamp":1628206394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt2021.dcc.fc.up.pt\/","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":"48","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":"27","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":"56% - 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":"6","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)"}}]}}