{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:32Z","timestamp":1760203052965,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031196843"},{"type":"electronic","value":"9783031196850"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-19685-0_8","type":"book-chapter","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T15:04:53Z","timestamp":1666019093000},"page":"101-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weighted Two-Way Transducers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5367-8208","authenticated-orcid":false,"given":"Fan","family":"Feng","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":[[2022,10,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Berstel, J.: Transductions and Context-free Languages. Teubner-Verlag (1979). https:\/\/doi.org\/10.1007\/978-3-663-09367-1","DOI":"10.1007\/978-3-663-09367-1"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Carnino, V., Lombardy, S.: On determinism and unambiguity of weighted two-way automata. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) Proceedings 14th International Conference Automata and Formal Languages. Electronic Proceedings of Theoretical Computer Science, vol. 151, pp. 188\u2013200. arXiv (2014). https:\/\/doi.org\/10.4204\/EPTCS.151.13","DOI":"10.4204\/EPTCS.151.13"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Dartois, L., Fournier, P., Jecker, I., Lhote, N.: On reversible transducers. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) Proceedings\u2013 Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.113","DOI":"10.4230\/LIPIcs.ICALP.2017.113"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with $$n$$ distinct prime factors. Am. J. Math. 35(4), 413\u2013422 (1913). https:\/\/doi.org\/10.2307\/2370405","journal-title":"Am. J. Math."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/11523468_42","volume-title":"Automata, Languages and Programming","author":"M Droste","year":"2005","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 513\u2013525. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_42"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science, Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5","DOI":"10.1007\/978-3-642-01492-5"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/371316.371512","volume":"2","author":"J Engelfriet","year":"2001","unstructured":"Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite state transducers. ACM Trans. Comput. Log. 2(2), 216\u2013254 (2001). https:\/\/doi.org\/10.1145\/371316.371512","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.3233\/FI-2011-559","volume":"111","author":"Z F\u00fcl\u00f6p","year":"2011","unstructured":"F\u00fcl\u00f6p, Z., Maletti, A., Vogler, H.: Weighted extended tree transducers. Fund. Inform. 111(2), 163\u2013202 (2011). https:\/\/doi.org\/10.3233\/FI-2011-559","journal-title":"Fund. Inform."},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Golan, J.S.: Semirings and their Applications. Kluwer Academic, Dordrecht (1999). https:\/\/doi.org\/10.1007\/978-94-015-9333-5","DOI":"10.1007\/978-94-015-9333-5"},{"key":"8_CR10","unstructured":"Goldstern, M.: Completion of semirings. Master\u2019s thesis, TU Wien (1985). https:\/\/doi.org\/10.48550\/arXiv.math\/0208134"},{"key":"8_CR11","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. (1998). https:\/\/doi.org\/10.1142\/3903","journal-title":"World Sci."},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Kirsten, D.: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. Acta Cybernetica 20(2), 211\u2013221 (2011). https:\/\/doi.org\/10.14232\/actacyb.20.2.2011.1","DOI":"10.14232\/actacyb.20.2.2011.1"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1051\/ita\/2016026","volume":"50","author":"S Lombardy","year":"2016","unstructured":"Lombardy, S.: Two-way representations and weighted automata. RAIRO Theor. Inf. Appl. 50(4), 331\u2013350 (2016). https:\/\/doi.org\/10.1051\/ita\/2016026","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Maletti, A., N\u00e1sz, A.: Weighted tree automata with constraints. In: Diekert, V., Volkov, M.V. (eds.) Proceedings 26th International Conference Developments in Language Theory. Lecture Notes in Computer Science, vol. 13257, pp. 226\u2013238. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_18","DOI":"10.1007\/978-3-031-05578-2_18"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Muscholl, A., Puppis, G.: The many facets of string transducers (invited talk). In: Niedermeier, R., Paul, C. (eds.) Proceedings 36th International Symposium Theoretical Aspects of Computer Science. LIPIcs, vol. 126, pp. 2:1\u20132:21. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2019.2","DOI":"10.4230\/LIPIcs.STACS.2019.2"},{"key":"8_CR16","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959). https:\/\/doi.org\/10.1147\/rd.32.0114","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"JC Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3(2), 198\u2013200 (1959). https:\/\/doi.org\/10.1147\/rd.32.0198","journal-title":"IBM J. Res. Dev."},{"key":"8_CR19","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"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19685-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T15:05:53Z","timestamp":1666019153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19685-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031196843","9783031196850"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19685-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algebraic Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cai2022.math.auth.gr\/","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":"17","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":"71% - 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.1","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","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 volume consist of 2 abstracts, 3 full papers of invited speakers","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)"}}]}}