{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:08:54Z","timestamp":1767229734215,"version":"3.48.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934880"},{"type":"electronic","value":"9783030934897"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_14","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"163-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Disambiguation of\u00a0Weighted Tree Automata"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Stier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Ulbricht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2013.02.005","volume":"480","author":"B Aminof","year":"2013","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Rigorous approximated determinization of weighted automata. Theoret. Comput. Sci. 480, 104\u2013117 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_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. Theoret. Comput. Sci. 289(1), 225\u2013251 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR3","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)"},{"issue":"4","key":"14_CR4","first-page":"509","volume":"16","author":"B Borchardt","year":"2004","unstructured":"Borchardt, B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybernet. 16(4), 509\u2013544 (2004)","journal-title":"Acta Cybernet."},{"issue":"3\/4","key":"14_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":"14_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. Theoret. Comput. Sci. 5(3), 325\u2013337 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90049-4","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR7","unstructured":"Comon, H., et al.: Tree automata techniques and applications (2007)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-68195-1_20","volume-title":"Language and Automata Theory and Applications","author":"F D\u00f6rband","year":"2021","unstructured":"D\u00f6rband, F., Feller, T., Stier, K.: Approximated determinisation of weighted tree automata. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 255\u2013266. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_20"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5","DOI":"10.1007\/978-3-642-01492-5"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Handbook of Weighted Automata [9], chap. 9, pp. 313\u2013403","DOI":"10.1007\/978-3-642-01492-5_9"},{"key":"14_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and Their Applications","author":"JS Golan","year":"1999","unstructured":"Golan, J.S.: Semirings and Their Applications. Kluwer Academic, Dordrecht (1999)"},{"key":"14_CR12","doi-asserted-by":"publisher","DOI":"10.1142\/3903","volume-title":"Semirings-Algebraic Theory and Applications in Computer Science","author":"U Hebisch","year":"1998","unstructured":"Hebisch, U., Weinert, H.J.: Semirings-Algebraic Theory and Applications in Computer Science. World Scientific, Singapore (1998)"},{"issue":"2\/3","key":"14_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(2\/3), 287\u2013312 (2005)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.tcs.2004.02.049","volume":"327","author":"I Klimann","year":"2004","unstructured":"Klimann, I., Lombardy, S., Mairesse, J., Prieur, C.: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theoret. Comput. Sci. 327(3), 349\u2013373 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S0218196794000063","volume":"4","author":"D Krob","year":"1994","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Internat. J. Algebra Comput. 4(3), 405\u2013425 (1994)","journal-title":"Internat. J. Algebra Comput."},{"issue":"2","key":"14_CR16","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."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2016.08.019","volume":"679","author":"M Mohri","year":"2017","unstructured":"Mohri, M., Riley, M.D.: A disambiguation algorithm for weighted automata. Theoret. Comput. Sci. 679, 53\u201368 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR18","unstructured":"Paul, E.: Expressiveness and decidability of weighted automata and weighted logics. Ph.D. thesis, University of Leipzig (2020)"},{"issue":"2","key":"14_CR19","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)","journal-title":"IBM J. Res. Dev."},{"key":"14_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A Salomaa","year":"2012","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New york (2012). https:\/\/doi.org\/10.1007\/978-1-4612-6264-0"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Simon, I.: Limited subsets of a free monoid. In: Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pp. 143\u2013150. IEEE (1978)","DOI":"10.1109\/SFCS.1978.21"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0017135","volume-title":"Mathematical Foundations of Computer Science 1988","author":"I Simon","year":"1988","unstructured":"Simon, I.: Recognizable sets with multiplicities in the tropical semiring. In: Chytil, M.P., Koubek, V., Janiga, L. (eds.) MFCS 1988. LNCS, vol. 324, pp. 107\u2013120. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0017135"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93489-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:04:21Z","timestamp":1767229461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_14","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":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}