2 search results - page 1 / 1 » Pushdown Games with Unboundedness and Regular Conditions |
FSTTCS
2003
Springer
13 years 10 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
FCT
2009
Springer
13 years 8 months ago
2009
Springer
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...