Weighted automata on infinite words in the context of Attacker-Defender games



: Halava V, Harju T, Niskanen R, Potapov I

Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE

: SAN DIEGO

: 2017

: Information and Computation

: INFORMATION AND COMPUTATION

: INFORM COMPUT

: 255

: 27

: 44

: 18

: 0890-5401

: 1090-2651

DOI: https://doi.org/10.1016/j.ic.2017.05.001(external)

: 10.1016/j.ic.2017.05.001


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.



Last updated on 2024-26-11 at 22:13