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

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.

[1]  Tero Harju,et al.  Weighted automata on infinite words in the context of Attacker-Defender games , 2017, Inf. Comput..

[2]  Michal Kunc,et al.  Regular solutions of language inequalities and well quasi-orders , 2005, Theor. Comput. Sci..

[3]  Igor Potapov,et al.  On the Computational Complexity of Matrix Semigroup Problems , 2012, Fundam. Informaticae.

[4]  Qinghui Liu,et al.  Undecidability of infinite post correspondence problem for instances of size 8 , 2012, RAIRO Theor. Informatics Appl..

[5]  Tero Harju,et al.  Undecidability of infinite post correspondence problem for instances of Size 9 , 2006, RAIRO Theor. Informatics Appl..

[6]  Krishnendu Chatterjee,et al.  Infinite-state games with finitary conditions , 2013, CSL.

[7]  Jean-Camille Birget,et al.  Two-letter group codes that preserve aperiodicity of inverse finite automata , 2007 .

[8]  David Garber,et al.  Braid Group Cryptography , 2007, ArXiv.

[9]  Igor Walukiewicz.  Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..

[10]  Julien Reichert.  On the Complexity of Counter Reachability Games , 2013, RP.

[11]  Yuri V. Matiyasevich,et al.  Decision problems for semi-Thue systems with a few rules , 2005, Theor. Comput. Sci..

[12]  Igor Potapov,et al.  On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups , 2010, Int. J. Found. Comput. Sci..

[13]  Andrey Bovykin,et al.  Long games on braids , 2006 .

[14]  Parosh Aziz Abdulla,et al.  Deciding Monotonic Games , 2003, CSL.

[15]  G. Collins.  Computing with quantum knots. , 2006, Scientific American.

[16]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[17]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[18]  Tero Harju,et al.  Undecidability in Integer Weighted Finite Automata , 1999, Fundam. Informaticae.

[19]  Tomás Brázdil,et al.  Reachability Games on Extended Vector Addition Systems with States , 2010, ICALP.

[20]  Julien Reichert,et al.  The Complexity of Robot Games on the Integer Line , 2013, QAPL.

[21]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[22]  Patrick Dehornoy,et al.  Unprovability results involving braids , 2007, 0711.3785.

[23]  P. Panangaden,et al.  A Categorical Presentation of Quantum Computation with Anyons , 2010 .

[24]  Olivier Ly,et al.  On effective construction of the greatest solution of language inequality XA ⊆ BX , 2014, Theor. Comput. Sci..

[25]  Michal Kunc.  The Power of Commuting with Finite Sets of Words , 2006, Theory of Computing Systems.

[26]  Orna Kupferman,et al.  What's Decidable about Weighted Automata? , 2011, ATVA.

[27]  Keijo Ruohonen,et al.  Reversible Machines and Post's Correspondence Problem for Biprefix Morphisms , 1985, J. Inf. Process. Cybern..

[28]  Igor Potapov.  Composition Problems for Braids , 2013, FSTTCS.

[29]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 2002, JACM.

[30]  Olivier Serre,et al.  Parity Games Played on Transition Graphs of One-Counter Processes , 2006, FoSSaCS.