R. Blumensath and E. Grädel, Automatic structures, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.51-62, 2000.
DOI : 10.1109/LICS.2000.855755

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

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

O. Carton and M. Michel, Unambiguous B??chi automata, Theoretical Computer Science, vol.297, issue.1-3, pp.37-81, 2003.
DOI : 10.1016/S0304-3975(02)00618-7

A. Carayol and S. Wöhrle, The Caucal hierarchy of infinite graphs, FSTTCS'03, pp.112-123, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00620170

H. D. Ebbinghaus and J. Flum, Finite Model Theory, 1995.

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

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

I. [. Niwi´nskiniwi´nski and . Walukiewicz, Ambiguity problem for automata on infinite trees

M. O. Rabin, Decidability of second-order theories and automata on infinite trees. Transactions of the, pp.1-35, 1969.

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

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