{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:54:05Z","timestamp":1743062045047,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030681944"},{"type":"electronic","value":"9783030681951"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-68195-1_21","type":"book-chapter","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:04:27Z","timestamp":1613952267000},"page":"267-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sequentiality of Group-Weighted Tree Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2942-0896","authenticated-orcid":false,"given":"Frederic","family":"D\u00f6rband","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8420-6118","authenticated-orcid":false,"given":"Thomas","family":"Feller","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0564-8688","authenticated-orcid":false,"given":"Kevin","family":"Stier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(87)90190-6","volume":"24","author":"A Alexandrakis","year":"1987","unstructured":"Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleene\u2019s theorem. Inf. Process. Lett. 24(1), 1\u20134 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-3975(01)00271-7","volume":"289","author":"MP B\u00e9al","year":"2002","unstructured":"B\u00e9al, M.P., Carton, O.: Determinization of transducers over finite and infinite words. Theor. Comput. Sci. 289(1), 225\u2013251 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"21_CR3","first-page":"509","volume":"16","author":"B Borchardt","year":"2004","unstructured":"Borchardt, B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybern. 16(4), 509\u2013544 (2004)","journal-title":"Acta Cybern."},{"issue":"3","key":"21_CR4","first-page":"417","volume":"8","author":"B Borchardt","year":"2003","unstructured":"Borchardt, B., Vogler, H.: Determinization of finite state weighted tree automata. J. Autom. Lang. Comb. 8(3), 417\u2013463 (2003)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3\/4","key":"21_CR5","first-page":"229","volume":"15","author":"M B\u00fcchse","year":"2010","unstructured":"B\u00fcchse, M., May, J., Vogler, H.: Determinization of weighted tree automata using factorizations. J. Autom. Lang. Comb. 15(3\/4), 229\u2013254 (2010)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","volume":"5","author":"C Choffrut","year":"1977","unstructured":"Choffrut, C.: Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles. Theor. Comput. Sci. 5(3), 325\u2013337 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90049-4","journal-title":"Theor. Comput. Sci."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-662-54458-7_13","volume-title":"Foundations of Software Science and Computation Structures","author":"L Daviaud","year":"2017","unstructured":"Daviaud, L., Jecker, I., Reynier, P.-A., Villevalois, D.: Degree of sequentiality of weighted automata. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 215\u2013230. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_13"},{"key":"21_CR8","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ins.2009.09.003","volume":"180","author":"M Droste","year":"2010","unstructured":"Droste, M., St\u00fcber, T., Vogler, H.: Weighted finite automata over strong bimonoids. Inf. Sci. 180, 156\u2013166 (2010)","journal-title":"Inf. Sci."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32940-1_11","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"E Filiot","year":"2012","unstructured":"Filiot, E., Gentilini, R., Raskin, J.-F.: Quantitative languages defined by functional automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 132\u2013146. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_11"},{"key":"21_CR11","series-title":"Monographs in Theoretical Computer Science. An EATCS Series.","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-01492-5_","volume-title":"Handbook of Weighted Automata","author":"Z F\u00fcl\u00f6p","year":"2009","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. Monographs in Theoretical Computer Science. An EATCS Series., pp. 313\u2013403. (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5_"},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and Their Applications","author":"J Golan","year":"1999","unstructured":"Golan, J.: Semirings and Their Applications. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"21_CR13","first-page":"287","volume":"10","author":"D Kirsten","year":"2005","unstructured":"Kirsten, D., M\u00e4urer, I.: On the determinization of weighted automata. J. Autom. Lang. Comb. 10, 287\u2013312 (2005)","journal-title":"J. Autom. Lang. Comb."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"May, J., Knight, K.: A Better N-Best List: practical determinization of weighted finite tree automata. In: Proceedings of the Human Language Technology Conference of the NAACL, Main Conference, pp. 351\u2013358. Association for Computational Linguistics, New York City, USA, June 2006","DOI":"10.3115\/1220835.1220880"},{"issue":"2","key":"21_CR15","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"issue":"3","key":"21_CR16","first-page":"89","volume":"40","author":"D Radovanovic","year":"2010","unstructured":"Radovanovic, D.: Weighted tree automata over strong bimonoids. Novi Sad J. Math. 40(3), 89\u2013108 (2010)","journal-title":"Novi Sad J. Math."},{"key":"21_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5","volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1 Word, Language, Grammar. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5"},{"key":"21_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6","volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3 Beyond Words. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68195-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:13:38Z","timestamp":1613952818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68195-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681944","9783030681951"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68195-1_21","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":"22 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/lata2020&2021\/","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":"52","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":"26","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":"50% - 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":"4","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)"}}]}}