Refereed journal article or data article (A1)
Weighted automata on infinite words in the context of Attacker-Defender games
List of Authors: Halava V, Harju T, Niskanen R, Potapov I
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Place: SAN DIEGO
Publication year: 2017
Journal: Information and Computation
Journal name in source: INFORMATION AND COMPUTATION
Journal acronym: INFORM COMPUT
Volume number: 255
Start page: 27
End page: 44
Number of pages: 18
ISSN: 0890-5401
eISSN: 1090-2651
DOI: http://dx.doi.org/10.1016/j.ic.2017.05.001
Abstract
The paper is devoted to several infinite-state Attacker-Defender games with reachability objectives. We prove the undecidability of checking for the existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games. To prove these results, we consider a model of weighted automata operating on infinite words and prove that the universality problem is undecidable for this new class of weighted automata. We show that the universality problem is undecidable by using a non-standard encoding of the infinite Post correspondence problem. (C) 2017 Elsevier Inc. All rights reserved.
The paper is devoted to several infinite-state Attacker-Defender games with reachability objectives. We prove the undecidability of checking for the existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games. To prove these results, we consider a model of weighted automata operating on infinite words and prove that the universality problem is undecidable for this new class of weighted automata. We show that the universality problem is undecidable by using a non-standard encoding of the infinite Post correspondence problem. (C) 2017 Elsevier Inc. All rights reserved.