No. Title Author Year
1 Church Synthesis on Register Automata over Linearly Ordered Data Domains Exibard, Léo et al. 2021
2 Synthesizing Computable Functions from Rational Specifications over Infinite Words Filiot, Emmanuel et al. 2021
3 Register Transducers Are Marble Transducers Douéneau-Tabot, Gaëtan et al. 2020
4 Synthesis from Weighted Specifications with Partial Domains over Finite Words Filiot, Emmanuel et al. 2020
5 Synthesis of Computable Regular Functions of Infinite Words Dave, Vrunda et al. 2020
6 The Adversarial Stackelberg Value in Quantitative Games Filiot, Emmanuel et al. 2020
7 Weighted Transducers for Robustness Verification Filiot, Emmanuel et al. 2020
8 Synthesis of Data Word Transducers Exibard, Léo et al. 2019
9 Two-Way Parikh Automata Filiot, Emmanuel et al. 2019
10 On Canonical Models for Rational Functions over Infinite Words Filiot, Emmanuel et al. 2018
11 The Complexity of Transducer Synthesis from Multi-Sequential Specifications Exibard, Léo et al. 2018
12 Formal Methods of Transformations (Dagstuhl Seminar 17142) Filiot, Emmanuel et al. 2017
13 Aperiodicity of Rational Functions Is PSPACE-Complete Filiot, Emmanuel et al. 2016
14 On Equivalence and Uniformisation Problems for Finite Transducers Filiot, Emmanuel et al. 2016
15 The Complexity of Rational Synthesis Condurache, Rodica et al. 2016
16 Finite-Valued Weighted Automata Filiot, Emmanuel et al. 2014
17 First-order Definable String Transformations Filiot, Emmanuel et al. 2014
18 Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games Bruyère, Véronique et al. 2014
19 Streamability of Nested Word Transductions Filiot, Emmanuel et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 19


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI