2014/11/18 by Vesa Halava, Tero Harju, Halava, Vesa +6
Computer Science · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Multi-Agent Systems and Negotiation #cs.FL #cs.GT #cs.LO
paper · pdf · doi:10.48550/arxiv.1411.4796
23 pages, 5 figures
openalex publication_date 2014/11/18 · arxiv created 2015/04/27 · arxiv updated 2015/04/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider infinite-state Attacker-Defender games with reachability objectives. The results of the paper are twofold. Firstly we prove a new language-theoretic result for weighted automata on infinite words and show its encoding into the framework of Attacker-Defender games. Secondly we use this novel concept to prove undecidability for checking existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games.