Sciweavers

97 search results - page 2 / 20
» Visibly Pushdown Games
Sort
View
ENTCS
2002
110views more  ENTCS 2002»
13 years 10 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat
SOFSEM
2012
Springer
12 years 5 months ago
Visibly Pushdown Transducers with Look-Ahead
Visibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPTla). Their trans...
Emmanuel Filiot, Frédéric Servais
MFCS
2010
Springer
13 years 8 months ago
Properties of Visibly Pushdown Transducers
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...
Emmanuel Filiot, Jean-François Raskin, Pier...
CSR
2008
Springer
14 years 4 days ago
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
Nutan Limaye, Meena Mahajan, Antoine Meyer
LICS
2008
IEEE
14 years 4 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski