Olivier Finkel

Some talks

  • On the High Complexity of Petri Nets omega-Languages, 41st International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2020, Paris, France, (held virtually) June 24-25, 2020.

  • The Automatic Baire Property and an Effective Property of omega-Rational Functions, 14th International Conference on Language and Automata Theory and Applications LATA 2020, Milan, Italy, March 4-6, 2020 (postponed).

  • Wadge degrees of omega-Languages of Petri Nets, International Conference Highlights of Logic, Games and Automata, Warsaw, Poland, september 18-20, 2019.

  • Polishness of some topologies related to automata, Workshop on Wadge Theory and Automata II, Torino, Italy, June 8th, 2018.

  • Polishness of some topologies related to automata, Thirty seventh Weak Arithmetics Days, JAF 2018, Florence, Italie, May 28-30, 2018.

  • Expressive Power of Evolving Neural Networks Working on Infinite Input Streams, 21st International Symposium on Fundamentals of Computation Theory, FCT 2017, Bordeaux, France, September 11-13, 2017.

  • Incompleteness Theorems, Large Cardinals, and Automata over Finite Words, 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017, Bern, Switzerland, 20-22 April 2017.

  • Independence Results in Automata Theory, Computability in Europe, Pursuit of the Universal, CiE 2016, Paris, June 27th- July 1st, 2016.

  • Set Theory and Automata Theory, International Workshop: The Role of the Higher Infinite in Mathematics and Other Disciplines, December 14-18, 2015, which was Part of the Newton Institute Program entitled: Mathematical, Foundational and Computational Aspects of the Higher Infinite, held in Cambridge, U.K., 19th August 2015 to 18th December 2015.

  • (Descriptive) Set Theory and Automata Theory, Annual Meeting of the Swiss Society for Logic and Philosophy of Science, SSLPS, Lausanne, Switzerland, November 20-21, 2015.

  • Logic, Complexity, and Infinite Computations, Logic Seminar, University of Kobe, Japan, July 14, 2015.

  • Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words, 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, Kyoto, Japan, July 6-10, 2015.

  • Sur la détermination des jeux de Gale-Stewart dont l'ensemble gagnant est accepté par automate à un compteur, Groupe de Travail de Théorie Descriptive des Ensembles, Université Paris 6, 7 avril 2015.

  • Logic, Complexity, and Infinite Computations, Workshop on Wadge theory and automata, Torino, Italie, 28 Janvier 2015.

  • Infinite games specified by 2-tape automata, Logic Colloquium, LC 2014, part of Vienna Summer of Logic, Vienna, Autriche, 14-18 juillet 2014.

  • The determinacy of infinite games specified by automata, Journées Calculabilités, JC 2014, Montpellier, 28-29 Avril 2014.

  • The determinacy of infinite games specified by automata, International Conference Highlights of Logic, Games and Automata, Paris, 18-21 Septembre 2013.

  • On the determinacy of infinite games specified by asynchronous two-tape Büchi automata, Réunion Annuelle du Groupe de Travail "Jeux" du GDR Informatique Mathématique, GT Jeux 2012, Cachan, 20-21 Septembre 2012.

  • Ambiguity of omega-Languages of Turing Machines, Turing Centenary Conference, Computability in Europe, CiE 2012, Cambridge, June 18-23, 2012.

  • Automates à Un Compteur et Hiérarchie de Wadge des Ensembles Analytiques Effectifs, Groupe de Travail de Théorie Descriptive des Ensembles, Université Paris 6, 15 Mai 2012.

  • Logic, Complexity, and Infinite Computations, Journées Calculabilités, Paris, 5-6 Mars 2012.

  • The Determicacy of Contest-Free Games, 29 th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, Paris, February 29th - March 3rd, 2012.

  • Logic, Complexity, and Infinite Computations, Séminaire Complexité, Logique et Informatique, Université Paris 7, Novembre 2011.

  • Wadge Games Between 1-Counter Automata and Models of Set Theory, Annual Workshop of the ESF Networking Programme on Games for Design and Verification, GAMES 2010, Oxford, September 20-23, 2010.

  • Wadge Games Between 1-Counter Automata and Models of Set Theory, 2nd Workshop on Games for Design, Verification and Synthesis, GASICS 2010, Paris, September 4, 2010.

  • Infinite Computations May Be Very Complex, Invited Lecture at Vingt-neuvièmes Journées sur les Arithmétiques Faibles, Weak Arithmetics Days 2010, Warsaw, Poland, June 22-24, 2010.

  • Sur les Langages de Figures Infinies Acceptés par Systèmes de Pavages, Séminaire Général de l'Equipe de Logique, Université Paris 7, France, Octobre 2009.

  • Decision Problems for Recognizable Languages of Infinite Pictures, Vingt-huitièmes Journées sur les Arithmétiques Faibles Weak Arithmetics Days 2009, Fontainebleau, France, June 2009.

  • Sur les Langages de Figures Infinies Acceptés par Systèmes de Pavages, Groupe de Travail de l'Equipe ESCAPE, Laboratoire d'Informatique Fondamentale de Marseille, Avril 2009.

  • There Exist Some Omega-Powers of Any Borel Rank, Dagstuhl Seminar on Topological and Game-Theoretic Aspects of Infinite Computations, Dagstuhl, Germany, June-July 2008.

  • Il Existe des Oméga-Puissances de Tout Rang Borélien , Séminaire "Automates" du LIAFA, Université Paris 7, France, Fevrier 2008.

  • Complexité Topologique des Omega-Puissances, Séminaire Général de l'Equipe de Logique, Université Paris 7, France, Fevrier 2008.

  • There Exist Some Omega-Powers of Any Borel Rank, 16th EACSL Annual Conference on Computer Science and Logic, CSL 2007, Joint Day with GAMES 07, Lausanne, Suisse, September 2007.

  • Undecidable Problems about Timed Automata, Groupe de Travail de l'Equipe MC2, Laboratoire de l'Informatique du Parallélisme, ENS Lyon, Janvier 2007.

  • On the Accepting Power of 2-Tape Büchi Automata, 23rd International Symposium on Theoretical Aspects of Computer Science, STACS 2006 , Marseille, France, February 23-25, 2006.