{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:01:32Z","timestamp":1743156092397,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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_14","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"167-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Integer Weighted Automata on Infinite Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3633-4902","authenticated-orcid":false,"given":"Vesa","family":"Halava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9640-6309","authenticated-orcid":false,"given":"Tero","family":"Harju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2210-1481","authenticated-orcid":false,"given":"Reino","family":"Niskanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7192-7853","authenticated-orcid":false,"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,6]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Almagor, S., Boker, U., Kupferman, O.: What\u2019s decidable about weighted automata? Inf. Comput. (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104651","DOI":"10.1016\/j.ic.2020.104651"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Blondin, M., Haase, C., Mazowiecki, F.: Affine extensions of integer vector addition systems with states. In: Proceedings of CONCUR 2018. LIPIcs, vol. 118, pp. 14:1\u201314:17 (2018). https:\/\/doi.org\/10.4230\/lipics.concur.2018.14","DOI":"10.4230\/lipics.concur.2018.14"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM Trans. Comput. Log. 11, 4 (2010). https:\/\/doi.org\/10.1145\/1805950.1805953","DOI":"10.1145\/1805950.1805953"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Culik, K., Kari, J.: Image compression using weighted finite automata. Comput. Graph. 17(3), 305\u2013313 (1993). https:\/\/doi.org\/10.1016\/0097-8493(93)90079-O","DOI":"10.1016\/0097-8493(93)90079-O"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Dong, J., Liu, Q.: Undecidability of infinite Post correspondence problem for instances of size 8. ITA 46(3), 451\u2013457 (2012). https:\/\/doi.org\/10.1051\/ita\/2012015","DOI":"10.1051\/ita\/2012015"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5"},{"key":"14_CR7","unstructured":"Halava, V.: Finite Substitutions and Integer Weighted Finite Automata. Licentiate thesis, University of Turku, Turku, Finland (1998)"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Halava, V., Harju, T.: Undecidability in integer weighted finite automata. Fundam. Inform. 38(1\u20132), 189\u2013200 (1999). https:\/\/doi.org\/10.3233\/FI-1999-381215","DOI":"10.3233\/FI-1999-381215"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Halava, V., Harju, T.: Undecidability of infinite post correspondence problem for instances of size 9. RAIRO - ITA 40(4), 551\u2013557 (2006)","DOI":"10.1051\/ita:2006039"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Halava, V., Harju, T., Niskanen, R., Potapov, I.: Weighted automata on infinite words in the context of Attacker-Defender games. Inf. Comput. 255, 27\u201344 (2017)","DOI":"10.1016\/j.ic.2017.05.001"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Halava, V., Matiyasevich, Y., Niskanen, R.: Small Semi-Thue system universal with respect to the termination problem. Fundam. Inform. 154(1\u20134), 177\u2013184 (2017)","DOI":"10.3233\/FI-2017-1559"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Kiefer, S., Murawski, A., Ouaknine, J., Wachter, B., Worrell, J.: On the complexity of equivalence and minimisation for Q-weighted automata. LMCS 9(1) (2013)","DOI":"10.2168\/LMCS-9(1:8)2013"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Matiyasevich, Y., S\u00e9nizergues, G.: Decision problems for Semi-Thue systems with a few rules. Theor. Comput. Sci. 330(1), 145\u2013169 (2005)","DOI":"10.1016\/j.tcs.2004.09.016"},{"key":"14_CR14","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Inc. (1967)"},{"key":"14_CR15","unstructured":"Neary, T.: Undecidability in binary tag systems and the Post correspondence problem for five pairs of words. In: STACS 2015. LIPIcs, vol. 30, pp. 649\u2013661 (2015)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Niskanen, R., Potapov, I., Reichert, J.: On decidability and complexity of low-dimensional robot games. J. Comput. Syst. Sci. 107, 124\u2013141 (2020)","DOI":"10.1016\/j.jcss.2019.08.003"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Roche, E., Schabes, Y.: Speech recognition by composition of weighted finite automata. In: Finite-State Language Processing, pp. 431\u2013454. MIT Press (1997)","DOI":"10.7551\/mitpress\/3007.001.0001"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Rogozhin, Y.: Small universal Turing machines. Theor. Comput. Sci. 168(2), 215\u2013240 (1996). https:\/\/doi.org\/10.1016\/S0304-3975(96)00077-1","DOI":"10.1016\/S0304-3975(96)00077-1"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"S\u00e9nizergues, G.: Some undecidable termination problems for Semi-Thue systems. Theor. Comput. Sci. 142(2), 257\u2013276 (1995)","DOI":"10.1016\/0304-3975(94)00278-9"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pp. 133\u2013192. MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:33:25Z","timestamp":1628206405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_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":"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)"}}]}}