R. Alur, T. A. Henzinger, and O. Kupferman, Alternating-time temporal logic, Journal of the ACM, vol.49, issue.5, pp.672-713, 2002.

M. Béal, O. Carton, C. Prieur, and J. Sakarovitch, Squaring transducers: an efficient procedure for deciding functionality and sequentiality, Theoretical Computer Science, vol.292, issue.1, pp.45-63, 2003.

J. Berstel and L. Boasson, Transductions and context-free languages, pp.1-278, 1979.
URL : https://hal.archives-ouvertes.fr/hal-00619779

A. Carayol and C. Löding, Uniformization in Automata Theory, Proceedings of the 14th Congress of Logic, pp.153-178, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01806575

K. Chatterjee, T. A. Henzinger, and N. Piterman, Strategy logic. Information and Computation, vol.208, pp.677-693, 2010.

C. Choffrut and M. P. Schützenberger, Décomposition de fonctions rationnelles, 2nd Annual Symposium on Theoretical Aspects of Computer Science, STACS, pp.213-226, 1986.

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

L. Daviaud, I. Jecker, P. Reynier, and D. Villevalois, Degree of sequentiality of weighted automata, Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, pp.215-230, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01782446

H. Springer-berlin, , 2017.

T. A. Luca-de-alfaro, R. Henzinger, and . Majumdar, Symbolic algorithms for infinite-state games, Proceedings of the 12th International Conference in Concurrency Theory, pp.536-550, 2001.

R. Ehlers, Symbolic bounded synthesis, Proceedings of the 22nd International Conference on Computer Aided Verification, CAV 2010, vol.6174, pp.365-379, 2010.

S. Eilenberg, Automata, Languages, and Machines, 1974.

E. Filiot, I. Jecker, C. Löding, and S. Winter, On equivalence and uniformisation problems for finite transducers, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, vol.125, pp.1-125, 2016.

E. Filiot, N. Jin, and J. Raskin, Exploiting structure in LTL synthesis, International Journal on Software Tools for Technology Transfer, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01196259

E. Filiot, N. Jin, and J. Raskin, Antichains and compositional algorithms for LTL synthesis, Formal Methods in System Design, vol.39, issue.3, pp.261-296, 2011.
DOI : 10.1007/s10703-011-0115-3
URL : https://hal.archives-ouvertes.fr/hal-01196265

W. Fridman, C. Löding, and M. Zimmermann, Degrees of lookahead in context-free infinite games, Computer Science Logic, 25th International Workshop / 20th

, , pp.264-276, 2011.

M. Eitan, O. H. Gurari, and . Ibarra, The complexity of decision problems for finite-turn multicounter machines, Journal of Computer and System Science, vol.22, issue.2, p.16, 1981.

, Transducer Synthesis from Multi-Sequential Specifications

M. Holtmann, L. Kaiser, and W. Thomas, Degrees of lookahead in regular infinite games, Proceedings of the 13th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2010, vol.6014, pp.252-266, 2010.

S. Jacobs, R. Bloem, R. Brenguier, R. Ehlers, T. Hell et al., The first reactive synthesis competition (SYNTCOMP 2014), vol.19, pp.367-390, 2017.
DOI : 10.1007/s10009-016-0416-3
URL : https://hal.archives-ouvertes.fr/hal-01373547

I. Jecker and E. Filiot, Multi-sequential word relations, Proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, pp.288-299, 2015.
DOI : 10.1007/978-3-319-21500-6_23
URL : http://arxiv.org/pdf/1504.03864

B. Jobstmann, S. Galler, M. Weiglhofer, and R. Bloem, Anzu: A tool for property synthesis, Computer Aided Verification, CAV, pp.258-262, 2007.
DOI : 10.1007/978-3-540-73368-3_29

J. R. Büchi and L. H. Landweber, Solving sequential conditions finite-state strategies. Transactions of the, vol.138, pp.295-311, 1969.

F. Klein and M. Zimmermann, How much lookahead is needed to win infinite games?, Logical Methods in Computer Science, vol.12, issue.3, p.4, 2016.
DOI : 10.1007/978-3-662-47666-6_36
URL : http://arxiv.org/pdf/1412.3701

F. Klein and M. Zimmermann, Prompt delay, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, vol.43, 2016.

K. Kobayashi, Classification of formal languages by functional binary transductions, Information and Control, vol.15, issue.1, pp.95-109, 1969.
DOI : 10.1016/s0019-9958(69)90651-2
URL : https://doi.org/10.1016/s0019-9958(69)90651-2

D. Kozen, Lower bounds for natural proof systems, FOCS, pp.254-266, 1977.
DOI : 10.1109/sfcs.1977.16

Y. Lustig and M. Y. Vardi, Synthesis from component libraries, STTT, vol.15, issue.5-6, pp.603-618, 2013.
DOI : 10.1007/978-3-642-00596-1_28
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-00596-1_28.pdf

A. Pnueli and R. Rosner, On the synthesis of a reactive module, ACM Symposium on Principles of Programming Languages, POPL, 1989.

S. Schewe and B. Finkbeiner, Bounded synthesis, Automated Technology for Verification and Analysis, vol.4762, pp.474-488, 2007.

W. Thomas, Church's problem and a tour through automata theory, Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, vol.4800, pp.635-655, 2008.
DOI : 10.1007/978-3-540-78127-1_35

M. Zimmermann, Delay games with WMSO+U winning conditions, vol.50, pp.145-165, 2016.
DOI : 10.1051/ita/2016018
URL : https://www.react.uni-saarland.de/publications/wmsoudelay_arxiv.pdf

M. Zimmermann, Finite-state strategies in delay games, Proceedings 8th International Symposium on Games, Automata, Logics and Formal Verification, pp.151-165, 2017.
DOI : 10.4204/eptcs.256.11
URL : https://arxiv.org/pdf/1709.03539