 |
|
|
|
| HAL: hal-00019914, version 1 |
| Detailed view |  Export this paper |
|
|
| Automata, Logics, and Infinite Games Allemagne (2002) |
|
|
|
|
| Two-Way Tree Automata Solving Pushdown Games |
|
|
| Thierry Cachat 1 |
|
|
| (2002) |
|
|
|
| The transition graph of the pushdown automaton defines the arena: the graph of the play and the partition of the vertex set needed to specify the parity winning condition. We know that such games are determined and that each of both players has a memoryless winning strategy on his winning region. The aim of this paper is to show how to compute effectively the winning region of Player 0 and a memoryless winning strategy. The idea is to simulate the pushdown system in the full W-tree, where W is a finite set of directions, and to use the expressive power of alternating two-way tree automata to answer these questions. Finally it is necessary to translate the 2-way tree automaton into an equivalent nondeterministic one-way tree automaton. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Lehrstuhl für Informatik VII, Logik und Theorie diskreter Systeme |
|
|
|
Rheinisch-Westfälische Technische Hochschule Aachen (RWTH) |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Computer Science and Game Theory |
|
|
| two-way – tree automata – pushdown games |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00019914, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00019914 | |
| oai:hal.archives-ouvertes.fr:hal-00019914 | |
| From: Thierry Cachat | |
| Submitted on: Wednesday, 1 March 2006 16:58:08 | |
| Updated on: Wednesday, 1 March 2006 17:05:13 | |
