Deterministic and game separability for regular languages of infinite trees

We show that it is decidable whether two regular languages of infinite trees are separable by a deterministic language, resp., a game language. We consider two variants of separability, depending on whether the set of priorities of the separator is fixed, or not. In each case, we show that separability can be decided in EXPTIME, and that separating automata of exponential size suffice. We obtain our results by reducing to infinite duration games with {\omega}-regular winning conditions and applying the finite-memory determinacy theorem of B\"uchi and Landweber.