{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:08:57Z","timestamp":1743005337625,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200279"},{"type":"electronic","value":"9783319200286"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_21","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"206-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Weighted Automata on Infinite Words in the Context of Attacker-Defender Games"],"prefix":"10.1007","author":[{"given":"Vesa","family":"Halava","sequence":"first","affiliation":[]},{"given":"Tero","family":"Harju","sequence":"additional","affiliation":[]},{"given":"Reino","family":"Niskanen","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45220-1_1","volume-title":"Computer Science Logic","author":"PA Abdulla","year":"2003","unstructured":"Abdulla, P.A., Bouajjani, A., d\u2019Orso, J.: Deciding monotonic games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 1\u201314. Springer, Heidelberg (2003)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-24372-1_37","volume-title":"Automated Technology for Verification and Analysis","author":"S Almagor","year":"2011","unstructured":"Almagor, S., Boker, U., Kupferman, O.: What\u2019s decidable about weighted automata? In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 482\u2013491. Springer, Heidelberg (2011)"},{"issue":"5","key":"21_CR3","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Arul, A., Reichert, J.: The complexity of robot games on the integer line. In: Proceedings of QAPL 2013, EPTCS, vol. 117, pp. 132\u2013148 (2013)","DOI":"10.4204\/EPTCS.117.9"},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1142\/S0129054110007660","volume":"21","author":"PC Bell","year":"2010","unstructured":"Bell, P.C., Potapov, I.: On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups. Int. J. Found. Comput. Sci. 21(6), 963\u2013978 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1\u20134","key":"21_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2012-663","volume":"116","author":"PC Bell","year":"2012","unstructured":"Bell, P.C., Potapov, I.: On the computational complexity of matrix semigroup problems. Fundam. Inform. 116(1\u20134), 1\u201313 (2012)","journal-title":"Fundam. Inform."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00233-007-9024-6","volume":"76","author":"JC Birget","year":"2008","unstructured":"Birget, J.C., Margolis, S.W.: Two-letter group codes that preserve aperiodicity of inverse finite automata. Semigroup Forum. 76, 159\u2013168 (2008). Springer","journal-title":"Semigroup Forum."},{"key":"21_CR8","unstructured":"Bovykin, A., Carlucci, L.: Long games on braids (2006). Preprint. Available online at http:\/\/logic.pdmi.ras.ru\/~andrey\/braids_final3.pdf"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-14162-1_40","volume-title":"Automata, Languages and Programming","author":"T Br\u00e1zdil","year":"2010","unstructured":"Br\u00e1zdil, T., Jan\u010dar, P., Ku\u010dera, A.: Reachability games on extended vector addition systems with states. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 478\u2013489. Springer, Heidelberg (2010)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1112\/plms\/pdq016","volume":"102","author":"L Carlucci","year":"2011","unstructured":"Carlucci, L., Dehornoy, P., Weiermann, A.: Unprovability results involving braids. Proc. Lond. Math. Soc. 102(1), 159\u2013192 (2011)","journal-title":"Proc. Lond. Math. Soc."},{"key":"21_CR11","unstructured":"Chatterjee, K., Fijalkow, N.: Infinite-state games with finitary conditions. In: Proceedings of CSL 2013, LIPIcs, vol. 23, pp. 181\u2013196 (2013)"},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/scientificamerican0406-56","volume":"294","author":"GP Collins","year":"2006","unstructured":"Collins, G.P.: Computing with quantum knots. Sci. Am. 294(4), 56\u201363 (2006)","journal-title":"Sci. Am."},{"key":"21_CR13","series-title":"Mathematical Surveys and Monographs","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/148","volume-title":"Ordering Braids","author":"P Dehornoy","year":"2008","unstructured":"Dehornoy, P., Dynnikov, I., Rolfsen, D., Wiest, B.: Ordering Braids. Mathematical Surveys and Monographs, vol. 148. American Mathematical Society, Providence (2008)"},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1051\/ita\/2012015","volume":"46","author":"J Dong","year":"2012","unstructured":"Dong, J., Liu, Q.: Undecidability of infinite post correspondence problem for instances of size 8. RAIRO - Theor. Inf. Appl. 46(3), 451\u2013457 (2012)","journal-title":"RAIRO - Theor. Inf. Appl."},{"key":"21_CR15","unstructured":"Doyen, L., Rabinovich, A.: Robot games. Technical report LSV-13-02, LSV, ENS Cachan (2013)"},{"key":"21_CR16","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word Processing in Groups","author":"D Epstein","year":"1992","unstructured":"Epstein, D., Paterson, M., Cannon, J., Holt, D., Levy, S., Thurston, W.P.: Word Processing in Groups. AK Peters, Ltd, USA (1992)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Garber, D.: Braid group cryptography. In: Braids: Introductory Lectures on Braids, Configurations and Their Applications, vol. 19, pp. 329 (2010)","DOI":"10.1142\/9789814291415_0006"},{"issue":"1\u20132","key":"21_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.3233\/FI-1999-381215","volume":"38","author":"V Halava","year":"1999","unstructured":"Halava, V., Harju, T.: Undecidability in integer weighted finite automata. Fundam. Inform. 38(1\u20132), 189\u2013200 (1999)","journal-title":"Fundam. Inform."},{"issue":"4","key":"21_CR19","first-page":"551","volume":"40","author":"V Halava","year":"2006","unstructured":"Halava, V., Harju, T.: Undecidability of infinite post correspondence problem for instances of size 9. ITA 40(4), 551\u2013557 (2006)","journal-title":"ITA"},{"key":"21_CR20","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 (2015). CoRR. abs\/1411.4796","DOI":"10.1007\/978-3-319-20028-6_21"},{"issue":"2\u20133","key":"21_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.tcs.2005.09.018","volume":"348","author":"M Kunc","year":"2005","unstructured":"Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theor. Comput. Sci. 348(2\u20133), 277\u2013293 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"21_CR22","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00224-006-1321-z","volume":"40","author":"M Kunc","year":"2007","unstructured":"Kunc, M.: The power of commuting with finite sets of words. Theory Comput. Syst. 40(4), 521\u2013551 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM 47(2), 312\u2013360 (2000)","journal-title":"J. ACM"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2014.02.001","volume":"528","author":"O Ly","year":"2014","unstructured":"Ly, O., Wu, Z.: On effective construction of the greatest solution of language inequality XA $$\\subseteq $$ BX. Theor. Comput. Sci. 528, 12\u201331 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"21_CR25","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2004.09.016","volume":"330","author":"Y Matiyasevich","year":"2005","unstructured":"Matiyasevich, Y., S\u00e9nizergues, G.: Decision problems for semi-thue systems with a few rules. Theor. Comput. Sci. 330(1), 145\u2013169 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR26","series-title":"Lecture Notes in Physics","first-page":"983","volume-title":"New Structures for Physics","author":"P Panangaden","year":"2011","unstructured":"Panangaden, P., Paquette, \u00c9.O.: A categorical presentation of quantum computation with anyons. In: Coecke, B. (ed.) New Structures for Physics. LNP, pp. 983\u20131025. Springer, Heidelberg (2011)"},{"issue":"4","key":"21_CR27","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"EL Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52(4), 264\u2013268 (1946)","journal-title":"Bull. Am. Math. Soc."},{"key":"21_CR28","unstructured":"Potapov, I.: Composition problems for braids. In: Proceedings of FSTTCS 2003, LIPIcs, vol. 24, pp. 175\u2013187 (2003)"},{"issue":"5","key":"21_CR29","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1090\/S0002-9904-1968-12122-6","volume":"74","author":"MO Rabin","year":"1968","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Bull. Am. Math. Soc. 74(5), 1025\u20131029 (1968)","journal-title":"Bull. Am. Math. Soc."},{"issue":"12","key":"21_CR30","first-page":"579","volume":"21","author":"K Ruohonen","year":"1985","unstructured":"Ruohonen, K.: Reversible machines and post\u2019s correspondence problem for biprefix morphisms. J. of Information Processing and Cybernetics 21(12), 579\u2013595 (1985)","journal-title":"J. of Information Processing and Cybernetics"},{"issue":"2","key":"21_CR31","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: games and model-checking. Inf. Comput. 164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:33:00Z","timestamp":1676025180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}