The Ground Tree Transducer Game with Identical Tree Automata

Authors:
János Apró;Sándor Vágvölgyi
Affiliations:
-;-
Venue:
Fundamenta Informaticae
Year:
2001

Citing 12
Cited 0

Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems

Information and Computation
Rewrite systems

Handbook of theoretical computer science (vol. B)
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
Proof lengths for equational completion

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
The ground tree transducer game

Fundamenta Informaticae
Simple and minimal ground term equation systems

Fundamenta Informaticae
Derivation trees of ground term rewriting systems

Information and Computation
Congruential complements of ground term rewrite systems

Theoretical Computer Science
Restricted ground tree transducers

Theoretical Computer Science
Bisimulation, Games, and Logic

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study that version of the ground tree transducer game where the same tree automaton appears as the first and second component of the associated ground tree transducer. We give conditions which imply that Beta has a winning strategy. Furthermore, we show the following decidability result. Given a ground tree transducer game where the underlying tree automaton A cannot evaluate some tree into a state or A is deterministic, we can decide which player has a winning strategy. Moreover, whatever player has a winning strategy, we can effectively construct a partial recursive winning strategy for him.