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)
  3. 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.
    4.   Articles dans des revues avec comité de lecture (73)
  4. 1. Filiot, E., Jecker, I. R., Puppis, G., Löding, C., Muscholl, A., & Winter, S. (2025). Finite-valued Streaming String Transducers. TheoretiCS, Volume 4. doi:10.46298/theoretics.25.1
  5. 2. Balachander, M., Filiot, E., & Gentilini, R. (2024). Passive Learning of Regular Data Languages in Polynomial Time and Data. Leibniz international proceedings in informatics, 311, 10. doi:10.4230/LIPIcs.CONCUR.2024.10
  6. 3. Filiot, E., Jecker, I. R., Löding, C., Muscholl, A., Puppis, G., & Winter, S. (2024). Finite-valued Streaming String Transducers. Proceedings - Symposium on Logic in Computer Science., 33. doi:10.1145/3661814.3662095
  7. 4. Filiot, E., & Winter, S. (2024). Synthesizing Computable Functions from Rational Specifications Over Infinite Words. International journal of foundations of computer science, 35(1AND2), 179-214. doi:10.1142/S012905412348009X
  8. 5. 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.
  9. 6. 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
  10. 7. 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
  11. 8. 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
  12. 9. 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
    13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>