• 
  Itaï Ben Yaacov, Tomás Ibarlucía, Todor Tsankov. Eberlein oligomorphic groups. Transactions of the American Mathematical Society, 2017, 370 (3), pp.2181-2209. ⟨10.1090/tran/7227⟩. ⟨hal-01275112v3⟩
• 
  Itaï Ben Yaacov, Julien Melleray, Todor Tsankov. METRIZABLE UNIVERSAL MINIMAL FLOWS OF POLISH GROUPS HAVE A COMEAGRE ORBIT. Geometric And Functional Analysis, 2017, 27 (1), pp.67--77. ⟨hal-01266539v3⟩
• 
  Olivier Finkel. The exact complexity of the infinite Post Correspondence Problem. Information Processing Letters, 2015, 115 (6-8), pp.609-611. ⟨10.1016/j.ipl.2015.02.009⟩. ⟨hal-01376975⟩
• 
  Olivier Finkel. Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words. 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, Jul 2015, Kyoto, Japan. pp.222--233, ⟨10.1007/978-3-662-47666-6_18⟩. ⟨hal-01234945⟩
• 
  Olivier Finkel. Locally Finite ω-Languages and Effective Analytic Sets Have the Same Topological Complexity. Mathematical Logic Quarterly, 2016, 62 (4-5), pp.303-318. ⟨10.1002/malq.201400113⟩. ⟨hal-01132963⟩
• 
  Olivier Finkel, Dominique Lecomte, Pierre Simonnet. An Upper Bound on the Complexity of Recognizable Tree Languages. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2015, 49 (2), pp.121-137. ⟨hal-01128609⟩
• 
  Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre. The Wadge Hierarchy of Petri Nets omega-Languages. Vasco Brattka, Hannes Diener, and Dieter Spreen. Logic, Computation, Hierarchies, Festschrift Volume in Honor of Victor Selivanov at the occasion of his sixtieth birthday., 4, De Gruyter, pp.109-138, 2014, Ontos Mathematical Logic, 978-1-61451-804-4. ⟨hal-00743510v3⟩
• 
  Olivier Finkel. Ambiguity of $\omega$-Languages of Turing Machines. Logical Methods in Computer Science, 2014, 10 (3:12), pp.1-18. ⟨hal-00735050v2⟩
• 
  Julien Melleray, Lionel Nguyen van Thé, Todor Tsankov. Polish groups with metrizable universal minimal flows. International Mathematics Research Notices, 2015, 2016 (5), pp.1285-1307. ⟨10.1093/imrn/rnv171⟩. ⟨hal-00983248⟩
• 
  Olivier Finkel, Michał Skrzypczak. On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. Information Processing Letters, 2014, 114 (5), pp.229-233. ⟨hal-00936744⟩
• 
  Olivier Finkel. Infinite Games Specified by 2-Tape Automata. Annals of Pure and Applied Logic, 2016, 167 (12), pp.1184-1212. ⟨10.1016/j.apal.2016.05.005⟩. ⟨hal-00918326⟩
• 
  Olivier Finkel. The Determinacy of Context-Free Games. The Journal of Symbolic Logic, 2013, 78 (4), pp.1115-1134. ⟨hal-00916865⟩
• 
  Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre. The Wadge Hierarchy of Petri Nets omega-Languages. International Symposium on Logical Foundations of Computer Science, LFCS 2013, Jan 2013, San Diego, United States. pp.179-193, ⟨10.1007/978-3-642-35722-0_13⟩. ⟨hal-00799936⟩
• 
  Olivier Finkel. Topological Complexity of Context-Free omega-Languages: A Survey. Nachum Dershowitz and Ephraim Nissan. Language, Culture, Computation. Computing - Theory and Technology - Essays Dedicated to Yaacov Choueka on the Occasion of His 75th Birthday, Part I, 8001, Springer, pp.50--77, 2014, Lecture Notes in Computer Science, 978-3-642-45320-5. ⟨ensl-00286373v2⟩
• 
  Olivier Finkel, Stevo Todorcevic. Automatic Ordinals. International Journal of Unconventional Computing, 2013, 9 (1-2), pp.61-70. ⟨hal-00695443⟩
• 
  Olivier Finkel, Dominique Lecomte. Decision Problems For Turing Machines. Information Processing Letters, 2009, 109 (23-24), pp.1223-1226. ⟨hal-00413331⟩
• 
  Olivier Finkel, Dominique Lecomte. Classical and Effective Descriptive Complexities of omega-Powers. Annals of Pure and Applied Logic, 2009, 160 (2), pp.163-191. ⟨ensl-00168644v2⟩
• 
  Pandelis Dodos, Jordi Lopez Abad, Stevo Todorcevic. Unconditional basic sequences in spaces of large density. 2008. ⟨hal-00278606v3⟩

18

3