We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
– Classic Low-Density Parity-Check (LDPC) codes have recently been used as component codes in Multilevel Coding (MLC) due to their impressive BER performance as well as owing to ...