3 search results - page 1 / 1 » Parametrized Regular Infinite Games and Higher-Order Pushdow... |
FCT
2009
Springer
15 years 2 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...
ESOP
2008
Springer
15 years 2 days ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
101
click to vote
IJFCS
2008
14 years 10 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...