Mid-term Meeting, Bordeaux, 5-7/12/2018.
Programme
- Mercredi 5 décembre 2018 (in 178)
- 11h00-12h00 Michał Pilipczuk (invited) On the number of types in sparse graphs
- Lunch break
- 14h00-14h30 Thomas Colcombet Parity games and universal graphs (board talk)
- 14h30-15h00 Nathanaël Fijalkow Mean payoff games and universal graphs
- Coffee break
- 15h30-16h00 Sougata Bose Origin-equivalence of two-way word transducers is in PSPACE
- 16h00-16h30 Nathan Lhote Observation synthesis for games with imperfect information
- 16h30-17h00 Léo Exibard The Complexity of Transducer Synthesis from Multi-Sequential Specifications
- 17h00-17h30 Fabian Reiter Distributed Algorithms as Register Automata
- Jeudi 6 décembre 2018 (in 76)
- 9h00-10h00 Alexander Clark (invited) Consistent Estimators for Probabilistic Context-Free Grammars
- Coffee break
- 10h25-10h55 Gaëtan Douéneau-Talbot On the Complexity of Infinite Advice Strings
- 11h00-12h00 Business meeting of Delta (or attending the talk at IMB)
- Lunch break
- 14h00-15h00 Bruno Guillon (invited) Concise representations of regular languages
- Coffee break
- 15h30-16h00 Olivier Carton Preservation of normality by transducers
- 16h00-16h30 Emilia Descotte Closure properties of synchronized relations
- 16h30-17h00 Varun Ramanathan A logic for synchronous relations
- Social dinner
- Vendredi 7 décembre 2018 (in 76)
- 9h-10h Aurélien Lemay (invited) Query Inference for Semi-structured Data
- Coffee break
- 10h30-11h00 Nicolas Baudru From Two-Way Transducers to Regular Function Expressions
- 11h00-11h30 Paul Gallot The double sided Dyck Language is not a linear MCFL
- Farewell lunch
Quelques exposés qui pourraient vous intéresser cette semaine à Bordeaux :
- Ghazal Kachigar : Introduction to quantum computing lundi 3 décembre, 14h, 178
- Nathanaël Fijalkow : Data generation for programme synthesis mardi 4 décembre, 11h, 178
- Maxime Sangnier : What can a statistician expect from GANs jeudi 6 décembre, 11h, salle de conférence IMB (Institut Mathématiques de Bordeaux)
- Michał Pilipczuk : About sparse graphs, vendredi 7 décembre, 14h, 178
Third Meeting, Paris, 26-28/03/2018.
See the irif page for more details.
Second Meeting, Porquerolles, 17-20/10/2017.
Participants
Nicolas Bacquey, Thomas Colcombet, Laure Daviaud, Diego Figueira, Dimitri Gallois, Nathan Lhote, Benjamin Monmege, Joachim Niehren, Théo Pierron, Jean-Eric Pin, Gabriele Puppis, Fabian Reiter, Pierre-Alain Reynier, Jean-Marc Talbot, Didier Villevalois, Marc Zeitoun
Programme
- Mardi 17 octobre 2017
- 14h-15h Présentation et avancement des Work Packages - rappel des livrables
- 15h30-16h15 Jean-Eric Pin, Difference hierarchies
- 16h15-17h Fabian Reiter, Asynchronous Distributed Automata
- Mercredi 18 octobre 2017
- 9h15-10h15 Théo Pierron, Complexity of some separation problems
- 10h15-10h45 Thomas Colcombet, Knowledge package
- 11h15-12h15 Thomas Colcombet, Separation of tropical automata
- 16h-17h Laure Daviaud, Weighted Automata and identities
- Jeudi 19 octobre 2017
- 9h-10h Didier Villevalois, Sequentialisation of String-to-Outer-Context Finite State Transducers
- 10h-11h Nicolas Bacquey, Can DTOP equivalence be solved in PTIME?
- 11h30-12h15 Jean-Marc Talbot, 2way Visibly Pushdown transducers
- 16h-17h10 Benjamin Monmege, Weighted automata vs transducers with infinite ranges: specification and algorithms
- 17h10-18h30 Nathan Lhote, On minimization for transducers over infinite words
- Vendredi 20 octobre 2017
- 9h-9:45 Diego Figuera, TBA (« Trenes de Buenos Aires ») / Synchronizing relations on words
- 9h45-10h15 Fabian Reiter, Emptiness problems for distributed automata
- 10h15-10h45 Benjamin Monmege, Discussion WP Tools
- 11h15-12h15 Joachim Niehren, Projection for nested word automata: speeds-up XPath evaluation on XML streams
Kickoff Meeting, Bordeaux, 9-10/02/2017.
Participants
Felix Baschenis, Pierre Bourhis, Olivier Carton, Thomas Colcombet, Louis-Marie Dando, Diego Figueira, Emmanuel Filiot, Dimitri Gallois, Olivier Gauwin, Ismaël Jecker, Sylvain Lombardy, Benjamin Monmege, Anca Muscholl, Théo Pierron, Jean-Eric Pin, Thomas Place, Gabriele Puppis, Fabian Reiter, Pierre-Alain Reynier, Sylvain Salvati, Jean-Marc Talbot, Marc Zeitoun
Programme
- Jeudi 9 février 2017
- 9h30-9h45 Marc Zeitoun, Informations concernant le projet (transparents de la réunion d'information par l'ANR, 1/12/2016).
- 9h45-10h45 Emmanuel Filiot, Automata, logic and algebra for word transductions.
- 11h15-12h Olivier Carton, Resynchronisation de transducteurs.
- 12h-12h30 Pierre Bourhis, Tree Automata for Reasoning in Databases and Artificial Intelligence.
- 14h-14h30 Ismaël Jecker, On Equivalence and Uniformisation Problems for Finite Transducers.
- 14h30-15h00 Sylvain Salvati, Décomposition des transducteurs à flots k-valués.
- 15h15-15h45 Pierre-Alain Reynier, Two new twinning properties for transducers.
- 16h-17h Thomas Colcombet, Automata minimisable by design.
- Vendredi 10 février 2017
- 9h-9h45 Jean-Marc Talbot, From two-way to one-way transducers: a Shepeherdson’s approach
- 9h45-10h30 Felix Baschenis, From two-way to one-way transducers: a non deterministic approach.
- 11h00-11h20 Jean-Eric Pin, Séparation et espaces de Pervin.
- 11h20-12h20 Thomas Place, Separation and Concatenations.
- 14h-14h45 Nathan Lhote, Decidable Logics for Transductions and Data Words.
- 15h-16h Fabian Reiter, Asynchronous Distributed Automata.