J. Richard Büchi & Lawrence H. Landweber (1969):
Solving sequential conditions by finite-state strategies.
Transactions of the AMS 138,
pp. 295–311,
doi:10.2307/1994916.
Stefan Dziembowski, Marcin Jurdzi\mathaccentV acute013nski & Igor Walukiewicz (1997):
How Much Memory is Needed to Win Infinite Games?.
In: Proceedings of the 12th LICS.
IEEE,
Washington - Brussels - Tokyo,
pp. 99–110,
doi:10.1109/LICS.1997.614939.
Kousha Etessami, Thomas Wilke & Rebecca A. Schuller (2005):
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata.
SIAM Journal on Computing 34(5),
pp. 1159–1175,
doi:10.1137/S0097539703420675.
Carsten Fritz & Thomas Wilke (2006):
Simulation Relations for Alternating Parity Automata and Parity Games.
In: Proceedings of the 10th DLT,
LNCS 4036.
Springer,
pp. 59–70,
doi:10.1007/11779148_7.
Yuri Gurevich & Leo Harrington (1982):
Trees, Automata and Games.
In: Proceedings of the 14th STOC,
San Francisco, CA.,
pp. 60–65,
doi:10.1145/800070.802177.
Michael Holtmann & Christof Löding (2007):
Memory Reduction for Strategies in Infinite Games.
In: Jan Holub & Jan Zdárek: CIAA,
LNCS 4783.
Springer,
pp. 253–264,
doi:10.1007/978-3-540-76336-9.
Christof Löding (2001):
Efficient Minimization of Deterministic Weak ω-Automata.
IPL 79,
pp. 105–109,
doi:10.1016/S0020-0190(00)00183-6.
Robert Paige & Robert E. Tarjan (1987):
Three partition refinement algorithms.
SIAM J. Comput. 16(6),
pp. 973–989,
doi:10.1137/0216062.
Wolfgang Thomas (1995):
On the synthesis of strategies in infinite games.
In: Proceedings of the 12th STACS,
LNCS 900.
Springer,
Munich, Germany,
pp. 1–13,
doi:10.1007/3-540-59042-0_57.
Wolfgang Thomas (1997):
Languages, Automata and Logic.
In: A. Salomaa & G. Rozenberg: Handbook of Formal Languages 3, Beyond Words.
Springer,
Berlin.
Nico Wallmeier, Patrick Hütten & Wolfgang Thomas (2003):
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications.
In: Proceedings of the 8th CIAA,
LNCS 2759.
Springer,
pp. 11–22,
doi:10.1007/3-540-45089-0_3.