Ouvrages édités à titre de seul éditeur ou en collaboration (2)

  1. 1. Filiot, E., Jungers, R., Potapov, I., et al. (2021). Special Issue on Reachability Problems, in Journal of Computer and System Sciences.
  2. 2. Filiot, E., Jungers, R., & Potapov, I. (2019). Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings. Springer. doi:10.1007/978-3-030-30806-3
  3.   Parties d'ouvrages collectifs (1)

  4. 1. Bohy, A., Bruyère, V., Filiot, E., & Raskin, J.-F. (2013). Synthesis from LTL specifications with mean-payoff objectives. In Tools and Algorithms for the Construction and Analysis of Systems (pp. 169-184). Springer Berlin Heidelberg.
  5.   Articles dans des revues avec comité de lecture (69)

  6. 1. Exibard, L., Filiot, E., & Khalimov, A. (2022). A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders. Automata, languages and programming,, 122 1-19.
  7. 2. Dave, V., Filiot, E., Krishna, S. N., & Lhote, N. (2022). Synthesis of Computable Regular Functions of Infinite Words. Logical methods in computer science, 18(2). doi:10.46298/lmcs-18(2:23)2022
  8. 3. Exibard, L., Filiot, E., Lhote, N., & Reynier, P.-A. (2022). COMPUTABILITY OF DATA-WORD TRANSDUCTIONS OVER DIFFERENT DATA DOMAINS. Logical methods in computer science, 18(3), 9:1-9:41. doi:10.46298/LMCS-18(3:9)2022
  9. 4. Filiot, E., & Winter, S. (2021). Synthesizing Computable Functions from Rational Specifications over Infinite Words. Leibniz international proceedings in informatics, 213, 43. doi:10.4230/LIPIcs.FSTTCS.2021.43
  10. 5. Exibard, L., Filiot, E., & Khalimov, A. (2021). Church synthesis on register automata over linearly ordered data domains. Leibniz international proceedings in informatics, 187, 28. doi:10.4230/LIPIcs.STACS.2021.28
  11. 6. Exibard, L., Filiot, E., & Reynier, P.-A. (2021). Synthesis of Data Word Transducers. Logical methods in computer science, 17(1).
  12. 7. Berthon, R., Fijalkow, N., Filiot, E., Guha, S., Maubert, B., Murano, A., Pinault, L., Pinchinat, S., Rubin, S., & Serre, O. (2021). Alternating Tree Automata with Qualitative Semantics. ACM transactions on computational logic, 22(1), 7. doi:10.1145/3431860
  13. 8. Filiot, E., & Reynier, P.-A. (2021). Copyful Streaming String Transducers. Fundamenta informaticae, 178(1-2), 59-76. doi:10.3233/FI-2021-1998
  14. 9. Filiot, E., Löding, C., & Winter, S. (2020). Synthesis from weighted specifications with partial domains over finite words. Leibniz international proceedings in informatics, 182, 46. doi:10.4230/LIPIcs.FSTTCS.2020.46

  15. << Précédent 1 2 3 4 5 6 7 8 Suivant >>