Weighted automata on infinite words in the context of Attacker-Defender games
Formal Languages and Automata Theory
2015-04-28 v3 Computer Science and Game Theory
Logic in Computer Science
Abstract
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.
Keywords
Cite
@article{arxiv.1411.4796,
title = {Weighted automata on infinite words in the context of Attacker-Defender games},
author = {Vesa Halava and Tero Harju and Reino Niskanen and Igor Potapov},
journal= {arXiv preprint arXiv:1411.4796},
year = {2015}
}
Comments
23 pages, 5 figures