• Home
• Members
• Meetings
• Publications
• Documents
• Tools
• Related projects
• Private Area

Meeting of May/June 2022, Marseille, 29/05 -> 03/06, CIRM

Participants

Nicolas Baudru, Killian Barbé, Olivier Carton, Antonio Casares, Thomas Colcombet, Luc Dartois, Gaëtan Douéneau, Mirna Dzamonja, Emmanuel Filiot, Séverine Fratani, Arthur Jaquard, Denis Kuperberg, Karoliina Lehtinen, Nathan Lhote, Théodore Lopez, Corto Mascle, Guillaume Maurras, Benjamin Monmege, Rémi Morvan, Tito Nguyen, Julie Parreaux, Vincent Penelle, Jean-Eric Pin, Thomas Place, Pierre-Alain Reynier, Jacques Sakarovitch, Géraud Sénizergues, Jean-Marc Talbot, Pascal Weil, Marc Zeitoun.

Programme

• Monday, May 30
  • 14:00 – 14:45 : Jacques Sakarovitch: Derived term automaton without derivation
  • 14:45 – 15:30 : Denis Kuperberg: Explorable automata
  • 16:00 – 16:45 : Antonio Casares : Positional conditions defined by deterministic Buchi automata
  • 16:45 – 18:00 : Discussions
• Tuesday, May 31
  • 09:30 – 10:15 : Jean-Eric Pin: How to prove that a language is regular or star-free? (Part1)
  • 10:45 – 11:30 : Thomas Place: The incredible mixed polynomial closure
  • 11:30 - 12:15 : Discussions
  • 14:00 – 14:45 : Mirna Dzamonja: Nice uncountable objects and effectiveness
  • 14:45 - : Discussions
• Wednesday, June 1
  • 09:30 – 10:15 : Emmanuel Filiot: Synthesis of data transducers
  • 10:45 – 11:30 : Tito Nguyen: A new application area for transducers: typed lambda-calculi
  • 11:30 - 12:15 : GaĂ©tan DouĂ©neau-Tabot: Continuous rational functions are deterministic
  • Afternoon: calanques
• Thursday, June 2
  • 09:30 – 10:30 : GĂ©raud SĂ©nizergues: On the equivalence problem for deterministic pushdown transducers
  • 11:00 – 11:45 : Olivier Carton: Deterministic pushdown automata can compress some normal sequence
  • 11:45 – 12:30 : Benjamin Monmege: Dynamics on games
  • 14:00 – 14:45 : Jean-Eric Pin: How to prove that a language is regular or star-free? (Part2)
  • 14:45 – 17:00 : Discussions
  • 17:00 – 18:00 : Business meeting
  • 20:00 : Dinner
• Friday, June 3
  • 09:30 – 10:15 : Pascal Weil: Asynchronous cascade products for trace languages and propositional dynamic logic
  • 10:45 – 11:30 : Thomas Colcombet: Uniformisation of MSO over ordinals
  • 11:30 – 12:15 : Arthur Jaquard: Complexity in tree algebras
  • 14:00 : End of meeting

(Online) Meeting of January 2022, Marseille -> visio, 04/01/2022

Participants

Nicolas Baudru, Olivier Carton, Thomas Colcombet, Gaëtan Douéneau, Léo Exibard, Arthur Jaquard, Karoliina Lehtinen, Nathan Lhote, Sylvain Lombardy, Théodore Lopez, Corto Mascle, Benjamin Monmege, Rémi Morvan, Julie Parreaux, Vincent Penelle, Jean-Eric Pin, Thomas Place, Pierre-Alain Reynier, Jacques Sakarovitch, Jean-Marc Talbot, Pascal Weil, Marc Zeitoun.

Programme

• Algebra:
  • 09:30 : Arthur Jaquard : A complexity approach to tree algebras: the polynomial case
  • 09:50 : Nathan Lhote : Register automata/orbit finite monoids
  • 10:10 : Discussions
• Quantitative:
  • 10:40 : Benjamin Monmege : Weighted First-Order Logic and Aperiodic Weighted Automata
  • 11:00 : Sylvain Lombardy: Morphisms of weighted automata
  • 11:20 : Karoliina Lehtinen: Quantitative synthesis and history determinism
  • 11:40 : Victor Marsault: Awali, a library for weighted automata and transducers
  • 12:00 : Discussions
• Logic:
  • 14:00 : Thomas Colcombet : First-order separation in PSPACE
  • 14:20 : RĂ©mi Morvan : Separation over infinite words
  • 14:40 : Denis Kuperberg : FO+
  • 15:00 : Discussions
• Transducers/Ambiguity:
  • 15:30 : Luc Dartois: Regular Expressions for aperiodic transducers
  • 15:50 : Pierre-Alain Reynier: Register minimization in finitely ambiguous (N,max,+) weighted automata
  • 16:10 : Olivier Carton: Ambiguity through the lens of measure theory
  • 16:30 : Discussions
• 17:00 : discussion gĂ©nĂ©rale sur Delta

Meeting of June 2021, IRIF, 28-29/06/2021, SG Room 3052

Participants

Olivier Carton, Antonio Casares, Christian Choffrut, Thomas Colcombet, Louis-Marie Dando, Gaëtan Douéneau, Léo Exibard, Sam van Gool, Edwin Hamel-De-Le-Court, Arthur Jaquard, Karoliina Lehtinen, Rémi Morvan, Vincent Penelle, Pierre-Alain Reynier, Jean-Marc Talbot, Nicolas Waldburger, Pascal Weil, Marc Zeitoun.

Programme

• Lundi 28 juin aprĂšs-midi
  • 14h00-14h45 Pascal Weil (LaBRI), Asynchronous wreath product decompositions for trace languages.
  • 14h50-15h35 Arthur Jaquard (IRIF), AlgĂšbres et langages d'arbres.
  • 16h00-16h45 RĂ©mi Morvan (ENS Paris-Saclay), Universal Algorithms for Parity Games and Nested Fixpoints.
  • 16h50-17h35 Louis-Marie Dando (LIS) Expressions et Automates PondĂ©rĂ©s pour les Monoı̈des PrĂ©-rationnels.

• Mardi 29 juin matin
  • 09h00-09h45 Thomas Colcombet (IRIF), Automates alternants Ă  paritĂ© et automates de BĂŒchi.
  • 10h00-10h45 Sam van Gool (IRIF), Time Warps, from Algebra to Algorithms.
  • 11h00-11h45 Antonio Casares (LaBRI), Minimisation d'automates de Rabin transition-based.

• Mardi 29 juin aprĂšs-midi.
  • 14h00-14h45 LĂ©o Exibard (AMU/ULB) Computability and Continuity of Data-Word Transductions.
  • 14h50-15h35 GaĂ«tan DouĂ©neau (DGA/IRIF), Pebble transducers with unary output.
  • 16h00-16h45 Olivier Carton (IRIF), Determinization of transducers over real numbers.

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-Tabot 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.