Emmanuel Filiot
Université libre de Bruxelles
127 Papers
681 Citations
Emmanuel Filiot is an academic researcher from Université libre de Bruxelles. The author has contributed to research in topics: Decidability & Undecidable problem. The author has an hindex of 22, co-authored 121 publications. Previous affiliations of Emmanuel Filiot include Laboratoire d'Informatique Fondamentale de Lille & university of lille.
Chat about Author
Papers
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs
TL;DR: In this article, the authors introduce the beyond worst-case synthesis problem, which is to construct strategies that guarantee some quantitative requirement in the worst case while providing an higher expected value against a particular stochastic model of the environment given as input.
10
Modeling Tree Structures, Machine Learning, and Information Extraction
Rémi Gilleron,Joachim Niehren,Karine Lewandowski,Anne-Cécile Caron,Aurélien Lemay,Yves Roos,Isabelle Tellier,Sophie Tison,Marc Tommasi,Fabien Torre,Mathias Samuelides,Sławek Staworko,Lingbo Kong,Florent Jousse,Patrick Marty,Jérôme Champavère,Emmanuel Filiot,Olivier Gauwin,Édouard Gilbert,Damien Poirier,Matthieu Keith,Hanh-Missi Tran,Feriel Lahlali +22 more
- 01 Jan 2007
TL;DR: This project wants to incorporate novel approaches for modeling tree structure and emerging techniques for machine learning into adaptive information extraction systems for the Web.
10
•Posted Content
First-order definable string transformations
TL;DR: A transducer-logic correspondence for Courcelle's first-order definable string transformations is established and a new notion of transition monoid for streaming string transducers is proposed that involves structural properties of both underlying input automata and variable dependencies.
10
•Journal Article
Satisfiability of a spatial logic with tree variables
TL;DR: The spatial logic TQL for querying semistructured data, represented as unranked ordered trees over an infinite alphabet, is investigated and it is shown that the satisfiability problem for guarded TQL formulas reduces to emptiness of TAGED, which extends tree automata with global equality and disequality constraints.
9
Register transducers are marble transducers
Gaëtan Douéneau-Tabot,Emmanuel Filiot,Paul Gastin +2 more
- 01 May 2020
TL;DR: The maximal number of marbles used is related with the amount of register copies performed by the streaming string transducer, and the class membership problems associated with these models are decidable.
9