B1 Vertaisarvioimaton kirjoitus tieteellisessä lehdessä
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
Tekijät: Halava V, Harju T, Niskanen R, Potapov I
Toimittaja: Arnold Beckmann, Victor Mitrana, Mariya Soskova
Konferenssin vakiintunut nimi: 11th Conference on computability in Europe, CiE 2015
Julkaisuvuosi: 2014
Journal: TUCS Publication Series
Kokoomateoksen nimi: Evolving computability
Tietokannassa oleva lehden nimi: EVOLVING COMPUTABILITY
Sarjan nimi: Lecture notes in computer science
Vuosikerta: 1118
ISBN: 978-3-319-20027-9
ISSN: 0302-9743
Verkko-osoite: http://tucs.fi/publications/view/?pub_id=tHaHaNiPo14b
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.
