A Characterisation of Context-Sensitive Languages by Consensus Games

We propose a game for recognising formal languages, in which two players with imperfect information need to coordinate on a common decision, given private input information. The players have a joint objec- tive to avoid an inadmissible decision, in spite of the uncertainty induced by the input. We show that this model of consensus acceptor games characterises context-sensitive languages, and conversely, that winning strategies in such games can be described by context-sensitive languages. This im- plies that it is undecidable whether a consensus game admits a winning strategy, and, even if so, it is PSPACE-hard to execute one. On the pos- itive side, we show that whenever a winning strategy exists, there exists one that can be implemented by a linear bounded automaton.

[1]  Ron van der Meyden,et al.  Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract) , 1999, FSTTCS.

[2]  J. Reif,et al.  Lower bounds for multiplayer noncooperative games of incomplete information , 2001 .

[3]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[4]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[5]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[7]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[8]  Igor Walukiewicz,et al.  Nondeterministic controllers of nondeterministic processes , 2008, Logic and Automata.

[9]  David Janin,et al.  On the (High) Undecidability of Distributed Synthesis Problems , 2007, SOFSEM.

[10]  Bernd Puchala,et al.  Synthesis of winning strategies for interaction under partial information , 2013 .

[11]  U. Dulleck,et al.  μ-σ Games , 2012, Games.

[12]  Sven Schewe,et al.  Distributed synthesis is simply undecidable , 2014, Inf. Process. Lett..

[13]  Michel Latteux,et al.  Recognizable Picture Languages and Domino Tiling , 1997, Theor. Comput. Sci..

[14]  Michel Latteux,et al.  Context-Sensitive String Languages and Eecognizable Picture Languages , 1997, Inf. Comput..

[15]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[16]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).