default search action
Emmanuel Filiot
Person information
- affiliation: Université libre de Bruxelles, Brussels, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j21]Emmanuel Filiot
, Sarah Winter
Synthesizing Computable Functions from Rational Specifications Over Infinite Words. Int. J. Found. Comput. Sci. 35(1&2): 179-214 (2024) - [c59]Mrudula Balachander
SynthLearn: A Tool for Guided Reactive Synthesis. Taming the Infinities of Concurrency 2024: 51-71 - [c58]Mrudula Balachander, Emmanuel Filiot
Passive Learning of Regular Data Languages in Polynomial Time and Data. CONCUR 2024: 10:1-10:21 - [c57]Emmanuel Filiot
Finite-valued Streaming String Transducers. LICS 2024: 33:1-33:14 - [i38]Emmanuel Filiot, Ismaël Jecker, Gabriele Puppis
Finite-valued Streaming String Transducers. CoRR abs/2405.08171 (2024) - 2023
- [c56]Olivier Carton
Deterministic Regular Functions of Infinite Words. ICALP 2023: 121:1-121:18 - [c55]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
A Regular and Complete Notion of Delay for Streaming String Transducers. STACS 2023: 32:1-32:16 - [c54]Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin:
LTL Reactive Synthesis with a Few Hints. TACAS (2) 2023: 309-328 - [i37]Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin:
LTL Reactive Synthesis with a Few Hints. CoRR abs/2301.10485 (2023) - [i36]Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, Sarah Winter:
Deterministic regular functions of infinite words. CoRR abs/2302.06672 (2023) - [i35]Rajeev Alur, Mikolaj Bojanczyk, Emmanuel Filiot, Anca Muscholl, Sarah Winter:
Regular Transformations (Dagstuhl Seminar 23202). Dagstuhl Reports 13(5): 96-113 (2023) - 2022
- [j20]Léo Exibard
Church synthesis on register automata over linearly ordered data domains. Formal Methods Syst. Des. 61(2): 290-337 (2022) - [j19]Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Synthesis of Computable Regular Functions of Infinite Words. Log. Methods Comput. Sci. 18(2) (2022) - [j18]Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier:
Computability of Data-Word Transductions over Different Data Domains. Log. Methods Comput. Sci. 18(3) (2022) - [c53]Emmanuel Filiot, Edwin Hamel-De le Court:
Two-Player Boundedness Counter Games. CONCUR 2022: 21:1-21:23 - [c52]Léo Exibard, Emmanuel Filiot, Ayrat Khalimov:
A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders. ICALP 2022: 122:1-122:19 - [i34]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
A Regular and Complete Notion of Delay for Streaming String Transducers. CoRR abs/2205.04287 (2022) - 2021
- [j17]Emmanuel Filiot, Pierre-Alain Reynier:
Copyful Streaming String Transducers. Fundam. Informaticae 178(1-2): 59-76 (2021) - [j16]Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
Synthesis of Data Word Transducers. Log. Methods Comput. Sci. 17(1) (2021) - [j15]Raphaël Berthon
Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. 22(1): 7:1-7:24 (2021) - [c51]Emmanuel Filiot, Sarah Winter:
Synthesizing Computable Functions from Rational Specifications over Infinite Words. FSTTCS 2021: 43:1-43:16 - [c50]Léo Exibard, Emmanuel Filiot, Ayrat Khalimov:
Church Synthesis on Register Automata over Linearly Ordered Data Domains. STACS 2021: 28:1-28:16 - [i33]Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier:
Computability of Data-Word Transductions over Different Data Domains. CoRR abs/2101.07038 (2021) - [i32]Emmanuel Filiot, Christof Löding, Sarah Winter:
Synthesis from Weighted Specifications with Partial Domains over Finite Words. CoRR abs/2103.05550 (2021) - [i31]Emmanuel Filiot, Sarah Winter:
Synthesizing Computable Functions from Rational Specifications over Infinite Words. CoRR abs/2103.05674 (2021) - [i30]Ayrat Khalimov, Emmanuel Filiot, Léo Exibard:
Transducer Synthesis from Universal Register Automata in (N, >). CoRR abs/2105.09978 (2021) - 2020
- [j14]Emmanuel Filiot, Nicolas Mazzocchi
A Pattern Logic for Automata with Outputs. Int. J. Found. Comput. Sci. 31(6): 711-748 (2020) - [c49]Emmanuel Filiot, Nicolas Mazzocchi
Weighted Transducers for Robustness Verification. CONCUR 2020: 17:1-17:21 - [c48]Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Synthesis of Computable Regular Functions of Infinite Words. CONCUR 2020: 43:1-43:17 - [c47]Léo Exibard
On Computability of Data Word Functions Defined by Transducers. FoSSaCS 2020: 217-236 - [c46]Emmanuel Filiot, Christof Löding, Sarah Winter:
Synthesis from Weighted Specifications with Partial Domains over Finite Words. FSTTCS 2020: 46:1-46:16 - [c45]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Adversarial Stackelberg Value in Quantitative Games. ICALP 2020: 127:1-127:18 - [c44]Gaëtan Douéneau-Tabot, Emmanuel Filiot
Register Transducers Are Marble Transducers. MFCS 2020: 29:1-29:14 - [i29]Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre:
Alternating Tree Automata with Qualitative Semantics. CoRR abs/2002.03664 (2020) - [i28]Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
On Computability of Data Word Functions Defined by Transducers. CoRR abs/2002.08203 (2020) - [i27]Léo Exibard, Emmanuel Filiot, Ayrat Khalimov:
Register Games on Infinite Ordered Data Domains. CoRR abs/2004.12141 (2020) - [i26]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Adversarial Stackelberg Value in Quantitative Games. CoRR abs/2004.12918 (2020) - [i25]Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin:
Register transducers are marble transducers. CoRR abs/2005.01342 (2020)
2010 – 2019
- 2019
- [j13]Emmanuel Filiot
Decidable weighted expressions with Presburger combinators. J. Comput. Syst. Sci. 106: 1-22 (2019) - [j12]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. Log. Methods Comput. Sci. 15(2) (2019) - [j11]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Logical and Algebraic Characterizations of Rational Transductions. Log. Methods Comput. Sci. 15(4) (2019) - [c43]Léo Exibard, Emmanuel Filiot
Synthesis of Data Word Transducers. CONCUR 2019: 24:1-24:15 - [c42]Luc Dartois
Two-Way Parikh Automata with a Visibly Pushdown Stack. FoSSaCS 2019: 189-206 - [c41]Emmanuel Filiot
Two-Way Parikh Automata. FSTTCS 2019: 40:1-40:14 - [e1]Emmanuel Filiot, Raphaël M. Jungers, Igor Potapov:
Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings. Lecture Notes in Computer Science 11674, Springer 2019, ISBN 978-3-030-30805-6 [contents] - [i24]Raphaël Berthon, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Jean-François Raskin, Sasha Rubin:
Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable. CoRR abs/1901.04349 (2019) - [i23]Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
Synthesis of Data Word Transducers. CoRR abs/1905.03538 (2019) - [i22]Léo Exibard, Emmanuel Filiot, Ismaël Jecker:
The Complexity of Transducer Synthesis from Multi-Sequential Specifications. CoRR abs/1905.03560 (2019) - [i21]Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Deciding the Computability of Regular Functions over Infinite Words. CoRR abs/1906.04199 (2019) - [i20]Emmanuel Filiot, Shibashis Guha, Nicolas Mazzocchi:
Two-way Parikh Automata. CoRR abs/1907.09362 (2019) - 2018
- [j10]Emmanuel Filiot
Decision problems of tree transducers with origin. Inf. Comput. 261: 311-335 (2018) - [j9]Ismaël Jecker, Emmanuel Filiot
Multi-Sequential Word Relations. Int. J. Found. Comput. Sci. 29(2): 271-296 (2018) - [j8]Emmanuel Filiot
Visibly pushdown transducers. J. Comput. Syst. Sci. 97: 147-181 (2018) - [c40]Emmanuel Filiot, Nicolas Mazzocchi
A Pattern Logic for Automata with Outputs. DLT 2018: 304-317 - [c39]Emmanuel Filiot
On Canonical Models for Rational Functions over Infinite Words. FSTTCS 2018: 30:1-30:17 - [c38]Luc Dartois
Logics for Word Transductions with Synthesis. LICS 2018: 295-304 - [c37]Emmanuel Filiot
Rational Synthesis Under Imperfect Information. LICS 2018: 422-431 - [c36]Léo Exibard, Emmanuel Filiot
The Complexity of Transducer Synthesis from Multi-Sequential Specifications. MFCS 2018: 46:1-46:16 - [i19]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
A Pattern Logic for Automata with Outputs. CoRR abs/1810.03515 (2018) - 2017
- [j7]Véronique Bruyère, Emmanuel Filiot
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Inf. Comput. 254: 259-295 (2017) - [j6]Krishnendu Chatterjee
Doomsday equilibria for omega-regular games. Inf. Comput. 254: 296-315 (2017) - [c35]Emmanuel Filiot, Nicolas Mazzocchi
Decidable Weighted Expressions with Presburger Combinators. FCT 2017: 243-256 - [c34]Emmanuel Filiot
On delay and regret determinization of max-plus automata. LICS 2017: 1-12 - [c33]Emmanuel Filiot
Copyful Streaming String Transducers. RP 2017: 75-86 - [i18]Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin:
On Delay and Regret Determinization of Max-Plus Automata. CoRR abs/1701.02903 (2017) - [i17]Luc Dartois, Emmanuel Filiot, Nathan Lhote:
Decidable Logics for Transductions and Data Words. CoRR abs/1701.03670 (2017) - [i16]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Logical and Algebraic Characterizations of Rational Transductions. CoRR abs/1705.03726 (2017) - [i15]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
Decidable Weighted Expressions with Presburger Combinators. CoRR abs/1706.08855 (2017) - [i14]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. CoRR abs/1707.00527 (2017) - [i13]Emmanuel Filiot
Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports 7(4): 23-37 (2017) - 2016
- [j5]Emmanuel Filiot
Transducers, logic and algebra for functions of finite words. ACM SIGLOG News 3(3): 4-19 (2016) - [c32]Emmanuel Filiot
Aperiodicity of Rational Functions Is PSPACE-Complete. FSTTCS 2016: 13:1-13:15 - [c31]Rodica Condurache, Emmanuel Filiot
The Complexity of Rational Synthesis. ICALP 2016: 121:1-121:15 - [c30]Emmanuel Filiot
On Equivalence and Uniformisation Problems for Finite Transducers. ICALP 2016: 125:1-125:14 - [c29]Luc Dartois
Two-Way Visibly Pushdown Automata and Transducers. LICS 2016: 217-226 - [c28]Emmanuel Filiot
First-order definability of rational transductions: An algebraic approach. LICS 2016: 387-396 - [i12]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
On Equivalence and Uniformisation Problems for Finite Transducers. CoRR abs/1602.08565 (2016) - [i11]Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot:
Two-Way Visibly Pushdown Automata and Transducers. CoRR abs/1606.00234 (2016) - 2015
- [j4]Emmanuel Filiot
Quantitative Languages Defined by Functional Automata. Log. Methods Comput. Sci. 11(3) (2015) - [c27]Ismaël Jecker, Emmanuel Filiot
Multi-sequential Word Relations. DLT 2015: 288-299 - [c26]Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision Problems of Tree Transducers with Origin. ICALP (2) 2015: 209-221 - [c25]Emmanuel Filiot
Logic-Automata Connections for Transformations. ICLA 2015: 30-57 - [i10]Ismaël Jecker, Emmanuel Filiot:
Multi-Sequential Word Relations. CoRR abs/1504.03864 (2015) - 2014
- [c24]Rodica Bozianu, Catalin Dima, Emmanuel Filiot:
Safraless Synthesis for Epistemic Temporal Specifications. CAV 2014: 441-456 - [c23]Emmanuel Filiot
Finite-Valued Weighted Automata. FSTTCS 2014: 133-145 - [c22]Emmanuel Filiot
First-order Definable String Transformations. FSTTCS 2014: 147-159 - [c21]Véronique Bruyère, Emmanuel Filiot
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. STACS 2014: 199-213 - [c20]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. VMCAI 2014: 78-97 - [c19]Véronique Bruyère, Emmanuel Filiot
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs. SR 2014: 1-8 - [i9]Rodica Bozianu, Catalin Dima, Emmanuel Filiot:
Safraless Synthesis for Epistemic Temporal Specifications. CoRR abs/1405.0424 (2014) - [i8]Emmanuel Filiot, Shankara Narayanan Krishna, Ashutosh Trivedi:
First-order definable string transformations. CoRR abs/1406.7824 (2014) - [i7]Emmanuel Filiot, Pierre-Alain Reynier:
On Streaming String Transducers and HDT0L Systems. CoRR abs/1412.0537 (2014) - 2013
- [j3]Emmanuel Filiot
Exploiting structure in LTL synthesis. Int. J. Softw. Tools Technol. Transf. 15(5-6): 541-561 (2013) - [c18]Emmanuel Filiot
From Two-Way to One-Way Finite State Transducers. LICS 2013: 468-477 - [c17]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin:
Synthesis from LTL Specifications with Mean-Payoff Objectives. TACAS 2013: 169-184 - [c16]Mathieu Caralp, Emmanuel Filiot
Expressiveness of Visibly Pushdown Transducers. TTATT 2013: 17-26 - [i6]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
From Two-Way to One-Way Finite State Transducers. CoRR abs/1301.5197 (2013) - [i5]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. CoRR abs/1309.5439 (2013) - [i4]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. CoRR abs/1311.3238 (2013) - 2012
- [c15]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Acacia+, a Tool for LTL Synthesis. CAV 2012: 652-657 - [c14]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. CONCUR 2012: 132-146 - [c13]Rajeev Alur, Emmanuel Filiot
Regular Transformations of Infinite Strings. LICS 2012: 65-74 - [c12]Emmanuel Filiot, Frédéric Servais:
Visibly Pushdown Transducers with Look-Ahead. SOFSEM 2012: 251-263 - [i3]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin:
Synthesis from LTL Specifications with Mean-Payoff Objectives. CoRR abs/1210.3539 (2012) - 2011
- [j2]Emmanuel Filiot
Antichains and compositional algorithms for LTL synthesis. Formal Methods Syst. Des. 39(3): 261-296 (2011) - [c11]Emmanuel Filiot
Streamability of Nested Word Transductions. FSTTCS 2011: 312-324 - 2010
- [j1]Emmanuel Filiot
Tree Automata with Global Constraints. Int. J. Found. Comput. Sci. 21(4): 571-596 (2010) - [c10]Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Compositional Algorithms for LTL Synthesis. ATVA 2010: 112-127 - [c9]Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin:
Efficient Enumeration for Conjunctive Queries over X-underbar Structures. CSL 2010: 80-94 - [c8]Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin:
Iterated Regret Minimization in Game Graphs. MFCS 2010: 342-354 - [c7]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Properties of Visibly Pushdown Transducers. MFCS 2010: 355-367 - [i2]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
On Functionality of Visibly Pushdown Transducers. CoRR abs/1002.1443 (2010) - [i1]Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin:
Iterated Regret Minimization in Game Graphs. CoRR abs/1002.1456 (2010)
2000 – 2009
- 2009
- [c6]Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
An Antichain Algorithm for LTL Realizability. CAV 2009: 263-277 - 2008
- [b1]Emmanuel Filiot
Logics for n-ary queries in trees. Lille University of Science and Technology, France, 2008 - [c5]Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Tree Automata with Global Constraints. Developments in Language Theory 2008: 314-326 - [c4]Emmanuel Filiot, Sophie Tison
Regular n-ary Queries in Trees and Variable Independence. IFIP TCS 2008: 429-443 - 2007
- [c3]Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Satisfiability of a Spatial Logic with Tree Variables. CSL 2007: 130-145 - [c2]Emmanuel Filiot
Polynomial time fragments of XPath with variables. PODS 2007: 205-214 - 2006
- [c1]Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison:
Composing Monadic Queries in Trees. PLAN-X 2006: 61-70
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: