Skip to Main content Skip to Navigation

Two-Way Tree Automata Solving Pushdown Games

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas
Contributor : Thierry Cachat <>
Submitted on : Wednesday, March 1, 2006 - 4:58:08 PM
Last modification on : Thursday, February 8, 2018 - 4:20:02 PM
Document(s) archivé(s) le : Saturday, April 3, 2010 - 10:39:20 PM


  • HAL Id : hal-00019914, version 1


Thierry Cachat. Two-Way Tree Automata Solving Pushdown Games. Automata, Logics, and Infinite Games, 2002, Germany. pp.303-317. ⟨hal-00019914⟩



Record views


Files downloads