Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Sequential compounds of combinatorial games
Theoretical Computer Science
Superlinear period lengths in some subtraction games
Theoretical Computer Science
Term rewriting and all that
The ground tree transducer game
Fundamenta Informaticae
Peg-Solitaire, String Rewriting Systems and Finite Automata
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Set constraints with projections are in NEXPTIME
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
For a terminating rewrite system R, and a ground term t1, two players alternate in doing R-reductions t1 驴 R t2 驴 R t3 驴 R ... That is, player 1 choses the redex in t1, t3, ..., and player 2 choses the redex in t2, t4, ... The player who cannot move (because tn is a normal form), loses.In this note, we propose some challenging problems related to certain rewrite games. In particular, we re-formulate an open problem from combinatorial game theory (do all finite octal games have an ultimately periodic Sprague-Grundy sequence?) as a question about rationality of some tree languages.We propose to attack this question by methods from set constraint systems, and show some cases where this works directly. Finally we present rewrite games from to combinatory logic, and their relation to algebraic tree languages.