A. Arnold, Rational ??-languages are non-ambiguous, Theoretical Computer Science, vol.26, issue.1-2, pp.221-223, 1983.
DOI : 10.1016/0304-3975(83)90086-5
URL : http://doi.org/10.1016/0304-3975(83)90086-5

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Proceedings of International Congress on Logic, pp.1-11, 1962.
DOI : 10.1007/978-1-4613-8928-6_23

J. R. Büchi and L. H. Landweber, Solving sequential conditions by finite-state strategies, Transactions of the American Mathematical Society, vol.138, pp.295-311, 1969.
DOI : 10.1090/S0002-9947-1969-0280205-0

A. Carayol and C. Löding, MSO on the Infinite Binary Tree: Choice and Order, Proceedings of the 16th Annual Conference of the European Association for Computer Science Logic, pp.161-176, 2007.
DOI : 10.1007/978-3-540-74915-8_15
URL : https://hal.archives-ouvertes.fr/hal-00620169

A. Carayol and S. Wöhrle, The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata, Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2003, pp.112-123, 2003.
DOI : 10.1007/978-3-540-24597-1_10

A. Church, Logic, arithmetic and automata, Proceedings of the International Congress of Mathematicians, pp.23-35, 1962.

A. Dawar and E. Grädel, The Descriptive Complexity of Parity Games, Proceedings of the 17th Annual Conference on Computer Science Logic, pp.354-368, 2008.
DOI : 10.1007/978-3-540-87531-4_26

H. Ebbinghaus and J. Flum, Finite Model Theory. Perspectives in Mathematical Logic, 1995.

Y. Gurevich and S. Shelah, Abstract, The Journal of Symbolic Logic, vol.13, issue.04, pp.1105-1119, 1983.
DOI : 10.2307/1971037

D. Kähler and T. Wilke, Complementation, disambiguation, and determinization of Büchi automata unified

S. Lifsches and S. Shelah, Abstract, The Journal of Symbolic Logic, vol.48, issue.04, pp.1206-1227, 1996.
DOI : 10.1007/BF01451165

S. Lifsches and S. Shelah, Abstract, The Journal of Symbolic Logic, vol.47, issue.01, pp.103-127, 1998.
DOI : 10.1007/BF01451165

C. Löding, Automata and Logics over Infinite Trees, 2009.

R. Mcnaughton, Testing and generating infinite sequences by a finite automaton, Information and Control, vol.9, issue.5, pp.521-530, 1966.
DOI : 10.1016/S0019-9958(66)80013-X

A. Monti and A. Peron, Systolic tree ??-languages: the operational and the logical view, Theoretical Computer Science, vol.233, issue.1-2, pp.1-18, 2000.
DOI : 10.1016/S0304-3975(97)00257-0

A. W. Mostowski, Regular expressions for infinite trees and a standard form of automata, Lecture Notes in Computer Science, vol.208, pp.157-168, 1984.
DOI : 10.1007/3-540-16066-3_15

M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc, vol.141, pp.1-35, 1969.

M. O. Rabin, Automata on Infinite Objects and Church's Problem, 1972.
DOI : 10.1090/cbms/013

A. Rabinovich, On decidability of monadic logic of order over the naturals extended by monadic predicates, Information and Computation, vol.205, issue.6, pp.870-889, 2007.
DOI : 10.1016/j.ic.2006.12.004

S. Safra, On the complexity of omega -automata, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.319-327, 1988.
DOI : 10.1109/SFCS.1988.21948

H. Seidl, Deciding Equivalence of Finite Tree Automata, SIAM Journal on Computing, vol.19, issue.3, pp.424-437, 1990.
DOI : 10.1137/0219027

A. L. Semenov, Decidability of monadic theories, Proceedings of the 11th International Symposium on Mathematical Foundations of Computer Science, pp.162-175, 1984.
DOI : 10.1007/BFb0030296

D. Siefkes, The recursive sets in certain monadic second order fragments of arithmetic. Arch. für mat. Logik und Grundlagenforschung, pp.71-80, 1975.

R. E. Stearns, H. B. Hunt, and I. , On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata, SIAM Journal on Computing, vol.14, issue.3, pp.598-611, 1985.
DOI : 10.1137/0214044

W. Thomas, Automata on infinite objects In Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pp.133-192, 1990.

W. Thomas, On the synthesis of strategies in infinite games, Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS '95, pp.1-13, 1995.
DOI : 10.1007/3-540-59042-0_57

W. Thomas, Languages, Automata, and Logic, Handbook of Formal Language Theory, pp.389-455, 1997.
DOI : 10.1007/978-3-642-59126-6_7

W. Thomas, Church???s Problem and a Tour through Automata Theory, Lecture Notes in Computer Science, vol.4800, pp.635-655, 2008.
DOI : 10.1007/978-3-540-78127-1_35