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

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.

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

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

[3]  A. Church.  Review: Emil L. Post, A Variant of a Recursively Unsolvable Problem , 1947 .

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

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

[6]  Richard J. Lipton,et al.  Polynomial-time algorithm for the orbit problem , 1986, JACM.

[7]  Igor Potapov,et al.  Undecidability of Two-dimensional Robot Games , 2016, MFCS.

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

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

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

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

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

[13]  A. M. Akimenkov.  Subgroups of the braid group B4 , 1991 .

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

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

[16]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

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

[18]  Tero Harju,et al.  Undecidability Bounds for Integer Matrices Using Claus Instances , 2007, Int. J. Found. Comput. Sci..

[19]  Tero Harju,et al.  Weighted Automata on Infinite Words in the Context of Attacker-Defender Games , 2015, CiE.

[20]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

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

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

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

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

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

[26]  Stéphane Gaubert,et al.  Reachability Problems for Products of Matrices in Semirings , 2006, Int. J. Algebra Comput..

[27]  Igor Potapov.  From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata , 2004, Developments in Language Theory.

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

[29]  Turlough Neary,et al.  Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words , 2013, STACS.

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

[31]  Igor Potapov,et al.  Reachability problems in quaternion matrix and rotation semigroups , 2008, Inf. Comput..

[32]  Владимир Николаевич Безверхний,et al.  О неразрешимости проблемы сопряженности подгрупп в группе крашеных кос $R_5$@@@Undecidability of the conjugacy problem for subgroups in the colored braid group $R_5$ , 1999 .

[33]  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..

[34]  L. Doyen,et al.  Robot Games , 2011 .

[35]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[36]  Igor Potapov,et al.  On undecidability bounds for matrix decision problems , 2008, Theor. Comput. Sci..

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

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

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

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

[41]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

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

[43]  V. N. Bezverkhnii,et al.  On the unsolvability of the conjugacy problem for subgroups of the groupR5 of pure braids , 1999 .

[44]  Igor Potapov,et al.  Membership and Reachability Problems for Row-Monomial Transformations , 2004, MFCS.

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

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

[47]  J. Reichert.  Reachability games with counters : decidability and algorithms , 2015 .

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