21 search results - page 5 / 5 » A Direct Translation from XPath to Nondeterministic Automata |
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...