{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:52:02Z","timestamp":1743130322634,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_30","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"427-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Weighted HOM-Problem Over Fields"],"prefix":"10.1007","author":[{"given":"Andreea-Teodora","family":"N\u00e1sz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18(2), 115\u2013148 (1982)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"30_CR2","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF01893886","volume":"28","author":"S Bozapalidis","year":"1991","unstructured":"Bozapalidis, S.: Effective construction of the synthetic algebra of a recognizable series on trees. Acta Informatica 28(4), 351\u2013363 (1991)","journal-title":"Acta Informatica"},{"issue":"4","key":"30_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1051\/ita\/1989230404491","volume":"23","author":"S Bozapalidis","year":"1989","unstructured":"Bozapalidis, S., Alexandrakis, A.: Repr\u00e9sentations matricielles des s\u00e9ries d\u2019arbre reconnaissables. RAIRO-Theor. Inform. Appl. 23(4), 449\u2013459 (1989)","journal-title":"RAIRO-Theor. Inform. Appl."},{"issue":"1\u20133","key":"30_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2007.11.022","volume":"393","author":"S Bozapalidis","year":"2008","unstructured":"Bozapalidis, S., Kalampakas, A.: Graph automata. Theor. Comput. Sci. 393(1\u20133), 147\u2013165 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.11.022","journal-title":"Theor. Comput. Sci."},{"key":"30_CR5","unstructured":"Comon, H., et al.: Tree automata \u2013 Techniques and applications (2007)"},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Creus, C., Gasc\u00f3n, A., Godoy, G., Ramos, L.: The HOM problem is EXPTIME-complete. In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, pp. 255\u2013264. IEEE (2012). https:\/\/doi.org\/10.1109\/LICS.2012.36","DOI":"10.1109\/LICS.2012.36"},{"issue":"5","key":"30_CR7","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4(5), 406\u2013451 (1970). https:\/\/doi.org\/10.1016\/S0022-0000(70)80041-1","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR8","doi-asserted-by":"publisher","unstructured":"Drewes, F.: Grammatical Picture Generation. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-32507-7","DOI":"10.1007\/3-540-32507-7"},{"key":"30_CR9","doi-asserted-by":"publisher","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5","DOI":"10.1007\/978-3-642-01492-5"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuske, D.: Weighted automata (2021)","DOI":"10.4171\/automata-1\/4"},{"key":"30_CR11","doi-asserted-by":"publisher","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Handbook of Weighted Automata [9], chap. 9, pp. 313\u2013403. https:\/\/doi.org\/10.4171\/Automata-1\/4","DOI":"10.4171\/Automata-1\/4"},{"key":"30_CR12","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree automata. Tech. Rep. 1509.06233, arXiv (2015)"},{"issue":"1\u20132","key":"30_CR13","first-page":"157","volume":"24","author":"R Gilleron","year":"1995","unstructured":"Gilleron, R., Tison, S.: Regular tree languages and rewrite systems. Fund. Inform. 24(1\u20132), 157\u2013175 (1995)","journal-title":"Fund. Inform."},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2508028.2501600","volume":"60","author":"G Godoy","year":"2013","unstructured":"Godoy, G., Gim\u00e9nez, O.: The HOM problem is decidable. J. ACM 60(4), 1\u201344 (2013)","journal-title":"J. ACM"},{"key":"30_CR15","doi-asserted-by":"publisher","unstructured":"Godoy, G., Gim\u00e9nez, O., Ramos, L., \u00c0lvarez, C.: The HOM problem is decidable. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 485\u2013494. ACM (2010). https:\/\/doi.org\/10.1145\/1806689.1806757","DOI":"10.1145\/1806689.1806757"},{"key":"30_CR16","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":"30_CR17","doi-asserted-by":"publisher","unstructured":"Hebisch, U., Weinert, H.J.: Semirings. World Scientific (1998). https:\/\/doi.org\/10.1142\/3903","DOI":"10.1142\/3903"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Hebisch, U., Weinert, H.J.: Semirings: algebraic theory and applications in computer science, vol. 5. World Scientific (1998)","DOI":"10.1142\/3903"},{"key":"30_CR19","unstructured":"Jurafsky, D., Martin, J.H.: Speech and Language Processing. Prentice Hall, Hoboken (2008)"},{"key":"30_CR20","doi-asserted-by":"publisher","unstructured":"Maletti, A., N\u00e1sz, A.T.: Weighted tree automata with constraints. In: Diekert, V., Volkov, M. (eds.) Developments in Language Theory. DLT 2022. LNCS, vol. 13257, pp. 226\u2013238. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_18","DOI":"10.1007\/978-3-031-05578-2_18"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Maletti, A., N\u00e1sz, A.T.: Weighted tree automata with constraints. Theory Comput. Syst. 1\u201328 (2023). https:\/\/arxiv.org\/abs\/2302.03434","DOI":"10.1007\/s00224-023-10144-w"},{"key":"30_CR22","doi-asserted-by":"publisher","unstructured":"Maletti, A., N\u00e1sz, A., Paul, E.: Weighted HOM-problem for nonnegative integers (2023). https:\/\/doi.org\/10.48550\/arXiv.2305.04117","DOI":"10.48550\/arXiv.2305.04117"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"N\u00e1sz, A.T.: Solving the weighted HOM-problem with the help of unambiguity. In: Gazdag, Z., Iv\u00e1n, S. (eds.) Proceedings of the 16th International Conference on Automata and Formal Languages, p. 200. Open Publishing Association (2023)","DOI":"10.4204\/EPTCS.386.16"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"N\u00e1sz, A.T.: The weighted HOM-problem over fields (2023). https:\/\/doi.org\/10.48550\/arXiv.2311.11067","DOI":"10.1007\/978-3-031-52113-3_30"},{"key":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0030294","volume-title":"Mathematical Foundations of Computer Science 1984","author":"D Perrin","year":"1984","unstructured":"Perrin, D.: Recent results on automata and infinite words. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 134\u2013148. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/BFb0030294"},{"key":"30_CR26","first-page":"1","volume":"30","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 30, 1\u201324 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"key":"30_CR27","unstructured":"Rosenfeld, A.: Picture Languages: Formal Models for Picture Recognition. Academic Press, Cambridge (2014)"},{"key":"30_CR28","doi-asserted-by":"publisher","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, New York (1978). https:\/\/doi.org\/10.1007\/978-1-4612-6264-0","DOI":"10.1007\/978-1-4612-6264-0"},{"issue":"2\u20133","key":"30_CR29","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Inform. Control 4(2\u20133), 245\u2013270 (1961). https:\/\/doi.org\/10.1016\/S0019-9958(61)80020-X","journal-title":"Inform. Control"},{"issue":"3","key":"30_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.jcss.2006.10.003","volume":"73","author":"T Schwentick","year":"2007","unstructured":"Schwentick, T.: Automata for xml-a survey. J. Comput. Syst. Sci. 73(3), 289\u2013315 (2007)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"30_CR31","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"JW Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. Syst. Sci. 1(4), 317\u2013322 (1967). https:\/\/doi.org\/10.1016\/S0022-0000(67)80022-9","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"30_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"JW Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory 2(1), 57\u201381 (1968). https:\/\/doi.org\/10.1007\/BF01691346","journal-title":"Math. Syst. Theory"},{"key":"30_CR33","doi-asserted-by":"publisher","unstructured":"Wilhelm, R., Seidl, H., Hack, S.: Compiler Design \u2013 Syntactic and Semantic Analysis. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-17540-4","DOI":"10.1007\/978-3-642-17540-4"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:05:26Z","timestamp":1711569926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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":"41% - 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.11","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":"7","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)"}}]}}