J. Büchi
L. Landweber
1969
Solving sequential conditions by finite-state strategies
Transactions of the American Mathematical Society
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
Proceedings of the international congress of mathematicians
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
http://www.grappa.univ-lille3.fr/tata
Release October, 12th 2007
J. Engelfriet
1978
On Tree Transducers for Partial Functions
Inf. Process. Lett.
7
4
170–172
http://dx.doi.org/10.1016/0020-0190(78)90060-1
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
Finite Model Theory and Its Applications
Springer
125–230
http://dx.doi.org/10.1007/3-540-68804-8_3
M. Holtmann
Ł. Kaiser
W. Thomas
2010
Degrees of lookahead in regular infinite games
Foundations of Software Science and Computational Structures
Springer
252–266
http://dx.doi.org/10.1007/978-3-642-12032-9_18
F. Hosch
L. Landweber
1972
Finite Delay Solutions for Sequential Conditions.
ICALP
45–60
C. Löding
2009
Logic and automata over infinite trees
Habilitation Thesis, RWTH Aachen, Germany
T. Milo
D. Suciu
V. Vianu
2003
Typechecking for XML transformers
J. Comput. Syst. Sci.
66
1
66–97
http://dx.doi.org/10.1016/S0022-0000(02)00030-2
F.P. Ramsey
1930
On a problem of formal logic
Proceedings of the London Mathematical Society
2
1
264
http://dx.doi.org/10.1007/978-0-8176-4842-8_1
S. Winter
2013
Uniformization of Automaton Definable Tree Relations
Masterthesis, RWTH Aachen, Germany