1. Cachat, T.: Symbolic strategy synthesis for games on pushdown graphs. In: Proc. 29th Int. Colloq. Automata, Languages and Programming (ICALP 02), Lect. Notes in Comp. Sci., vol. 2380, pp. 704–715. Springer, New York (2002)
2. Colcombet, T., Niwinski, D.: On the positional determinacy of edge-labeled games. Theor. Comp. Sci. 352(1–3), 190–196 (2006)
3. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proc. 32nd IEEE Symp. Found. of Comp. Sci. (FOCS 91), pp. 368–377. IEEE Computer Society Press, Los Alamitos (1991)
4. Gimbert, H., Zielonka, W.: Games where you can play optimally without any memory. In: Proc. 16th Int. Conf. on Concurrency Theory (CONCUR 05), Lect. Notes in Comp. Sci., vol. 3653, pp. 428–442. Springer, New York (2005)
5. Gradel, E.: Positional determinancy of infinite games. In: Proc. 21th Symp. on Theor. Aspects of Comp. Sci. (STACS 04), Lect. Notes in Comp. Sci., vol. 2996, pp. 4–18. Springer, New York (2004)