Communications publiées lors de congrès ou colloques nationaux et internationaux (12)

  1. 1. Exibard, L., Filiot, E., & Reynier, P.-A. (2019). Synthesis of Data Word Transducers. In W. Fokkink & R. J. Van Glabbeek (Eds.), 30th International Conference on Concurrency Theory: CONCUR 2019. (LIPICS). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
  2. 2. Carton, O., Douéneau-Tabot, G., Filiot, E., & Winter, S. (2023). Deterministic Regular Functions of Infinite Words. In 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany: Vol. 261 (pp. 121:1-121:18). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum f"ur Informatik. doi:10.4230/LIPIcs.ICALP.2023.121
  3. 3. Filiot, E. (2023). A Regular and Complete Notion of Delay for Streaming String Transducers. In 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany: Vol. 254 (pp. 32:1-32:16). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum f"ur Informatik. doi:10.4230/LIPIcs.STACS.2023.32
  4. 4. Balachander, M., Filiot, E., & Raskin, J.-F. (2023). LTL Reactive Synthesis with a Few Hints. In Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part II Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part II: Vol. 13994 (pp. 309-328). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-031-30820-8_20
  5. 5. Filiot, E., & Hamel De Le Court, E. (2022). Two-Player Boundedness Counter Games. In 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland: Vol. 243 (pp. 21:1-21:23). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum f"ur Informatik. doi:10.4230/LIPIcs.CONCUR.2022.21
  6. 6. Filiot, E., & Winter, S. (2021). Synthesizing Computable Functions from Rational Specifications over Infinite Words. In Foundations of Software Technology and Theoretical Computer Science Foundations of Software Technology and Theoretical Computer Science: Vol. 213 (pp. 43:1-43:16). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum f"ur Informatik. doi:10.4230/LIPIcs.FSTTCS.2021.43
  7. 7. Filiot, E., L"oding, C., & Winter, S. (2020). Synthesis from Weighted Specifications with Partial Domains over Finite Words. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference): Vol. 182 (pp. 46:1-46:16). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum f"ur Informatik. doi:10.4230/LIPIcs.FSTTCS.2020.46
  8. 8. Filiot, E., Guha, S., & Mazzocchi, N. (2019). Two-Way Parikh Automata. Leibniz international proceedings in informatics. doi:10.4230/LIPIcs.FSTTCS.2019.40
  9. 9. Exibard, L., Filiot, E., & Jecker, I. R. (2018). The Complexity of Transducer Synthesis from Multi-Sequential Specifications (MFCS'18). In I. Potapov, P. G. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations of Computer Science: MFCS 2018: Vol. 117 (pp. 1-16). (LIPICS). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. doi:10.4230/LIPIcs.MFCS.2018.46
  10. 10. Caralp, M., Filiot, E., Reynier, P.-A., Servais, F., & Talbot, J.-M. (2013). Expressiveness of Visibly Pushdown Transducers. TTATT (pp. 17-26).
  11. 11. Staworko, S., Filiot, E., & Chomiski, J. (2008). Querying regular sets of XML documents. International Workshop on Logic in Databases (LiD) (2008)
  12. 12. Filiot, E., Niehren, J., Talbot, J.-M., & Tison, S. (2006). Composing monadic queries in trees. In PLAN-X (pp. 61-70) BRICS, Department of Computer Science, University of Aarhus.

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