A4 Refereed article in a conference publication
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
Authors: Halava V, Harju T, Niskanen R, Potapov I
Conference name: Computability in Europe
Publisher: SPRINGER-VERLAG NEW YORK, MS INGRID CUNNINGHAM, 175 FIFTH AVE, NEW YORK, NY 10010 USA
Publication year: 2015
Journal: Lecture Notes in Computer Science
Journal name in source: EVOLVING COMPUTABILITY
Journal acronym: LECT NOTES COMPUT SC
Volume: 9136
First page : 206
Last page: 215
Number of pages: 10
ISBN: 978-3-319-20027-9
ISSN: 0302-9743
DOI: https://doi.org/10.1007/978-3-319-20028-6_21(external)
We consider several 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.
