Information and Computation
Handbook of theoretical computer science (vol. B)
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Journal of the ACM (JACM)
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
Journal of Symbolic Computation
A fast algorithm for constructing a tree automaton recognizing a congruential tree language
Theoretical Computer Science
Complete axiomatizations of some quotient term algebras
Theoretical Computer Science
Bisimulation, Games, and Logic
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
High Undecidability of Weak Bisimilarity for Petri Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
| Hi-index | 0.00 |
We introduce the ground tree transducer game (gtt game) played by Alpha and Beta. We deduce from the possibility of embedding gtt games into abstract games that for any gtt game there is either a winning Alpha-strategy or a winning Beta-strategy. We present several examples for the game, and show that any abstract game can be simulated by some gtt game 𝒢, a set S 1 of Alpha-strategies for 𝒢, and a set S 2 of Beta-strategies for 𝒢. Among several decidability and undecidability results, we show the following. It is decidable, given gtt games 𝒢 1 and 𝒢 2, whether 𝒢 1 and 𝒢 2 are equivalent. There is no algorithm to determine, given a gtt game 𝒢 and an Alpha-strategy π, whether π is a winning Alpha-strategy. There is no algorithm to determine, given a recursive set S of gtt games, whether or not there exists a game 𝒢 ∈,; S such that Alpha has a winning strategy for 𝒢.