J. Büchi & L. Landweber (1969):
Solving sequential conditions by finite-state strategies.
Transactions of the American Mathematical Society.
Available at http://dx.doi.org/10.1090/S0002-9947-1969-0280205-0.
A. Carayol & C. Löding (2012):
Uniformization in Automata Theory.
To appear in: Logic, Methodology and Philosophy of Science. Proceedings of the Fourteenth International congress. P. Schroeder-Heister, G. Heinzmann, W. Hodges, P. Edouard Bour, eds., London: College Publications.
A. Church (1962):
Logic, arithmetic and automata.
In: Proceedings of the international congress of mathematicians,
pp. 23–35.
Hu. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison & M. Tommasi (2007):
Tree Automata Techniques and Applications.
Available at http://www.grappa.univ-lille3.fr/tata.
Release October, 12th 2007.
F. Gèsceg & M. Steinby (1984):
Tree automata.
Akademiai Kiado.
E. Grädel, W. Thomas & T. Wilke (2002):
Automata, Logics, and Infinite Games.
Lecture Notes in Compter Science 2500.
Springer.
Erich Grädel (2007):
Finite Model Theory and Descriptive Complexity.
In: Finite Model Theory and Its Applications.
Springer,
pp. 125–230.
Available at http://dx.doi.org/10.1007/3-540-68804-8_3.
M. Holtmann, Ł. Kaiser & W. Thomas (2010):
Degrees of lookahead in regular infinite games.
In: Foundations of Software Science and Computational Structures.
Springer,
pp. 252–266.
Available at http://dx.doi.org/10.1007/978-3-642-12032-9_18.
F. Hosch & L. Landweber (1972):
Finite Delay Solutions for Sequential Conditions..
In: ICALP,
pp. 45–60.
C. Löding (2009):
Logic and automata over infinite trees.
Habilitation Thesis, RWTH Aachen, Germany.