A4 Refereed article in a conference publication

Weighted Automata on Infinite Words in the Context of Attacker-Defender Games




AuthorsHalava V, Harju T, Niskanen R, Potapov I

Conference nameComputability in Europe

PublisherSPRINGER-VERLAG NEW YORK, MS INGRID CUNNINGHAM, 175 FIFTH AVE, NEW YORK, NY 10010 USA

Publication year2015

JournalLecture Notes in Computer Science

Journal name in sourceEVOLVING COMPUTABILITY

Journal acronymLECT NOTES COMPUT SC

Volume9136

First page 206

Last page215

Number of pages10

ISBN978-3-319-20027-9

ISSN0302-9743

DOIhttps://doi.org/10.1007/978-3-319-20028-6_21


Abstract

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.




Last updated on 2024-26-11 at 11:06