15 search results - page 2 / 3 » Games with Winning Conditions of High Borel Complexity |
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
ACG
2003
Springer
13 years 10 months ago
2003
Springer
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously, is a function f of the size of the piles. Wytho...
TACAS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Information theoretic security, also called secrecy analysis, provides theoretical limit for secret data transmission even in wireless networking environment, and it is more focus...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...