Vincent Penelle

You can also check my page on dblp for an up to date official list

Phd :

Published in an international conference :

  • [c8] On synthesis of resynchronizers for transducers.
    Sougata Bose, Krishna Shankara Narayanan, Anca Muscholl, Vincent Penelle, and Gabriele Puppis.
    MFCS2019, pages 69:1–69:14,
    Access to article
  • [c7] Origin-equivalence of two-way word transducers is in PSPACE.
    Sougata Bose, Anca Muscholl, Vincent Penelle, and Gabriele Puppis.
    FSTTCS2018, pages 22:1–22:18,
    Access to article
  • [c6] On the boundedness problem for higher-order pushdown vector addition systems.
    Vincent Penelle, Sylvain Salvati, and Grégoire Sutre.
    FSTTCS2018, pages 44:1–44:20,
    Access to article
  • [c5] Constrained dynamic tree networks.
    Matthew Hague and Vincent Penelle.
    RP2018, pages 45–58,
    Access to article
  • [c4] Which Classes of Origin Graphs Are Generated by Transducers.
    Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon and Vincent Penelle.
    ICALP 2017: 114:1-114:13
    Download slides ; Access to article
  • [c3] Rewriting higher-order stack trees.
    Vincent Penelle.
    In Lev D. Beklemishev and Daniil V. Musatov, editors, CSR, volume 9139 of Lecture Notes in Computer Science, pages 364–397. Springer, 2015. Best Student Paper Award.
    Download slides ; HAL
  • [c2] The context-freeness problem is conp-complete for flat counter systems.
    Jérôme Leroux, Vincent Penelle, and Grégoire Sutre.
    In Franck Cassez and Jean-François Raskin, editors, ATVA, volume 8837 of Lecture Notes in Computer Science, pages 248–263.
    Springer, 2014. Download slides ; HAL
  • [c1] On the context-freeness problem for vector addition systems.
    Jérôme Leroux, Vincent Penelle, and Grégoire Sutre.
    In LICS, pages 43–52. IEEE Computer Society, 2013.
    Download slides ; HAL

Published in a journal :

  • [j1] Rewriting higher-order stack trees.
    Vincent Penelle.
    Theory Comput. Syst. 61(2): 536-580 (2017).
    Access to article
  • [j2] Undecidability of a weak version of MSO+U.
    Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, and Sreejith A.V.
    Logical Methods in Computer Science. 16(1) (2020).
    Access to article

Others:

  • [d3] Origin-equivalence of two-way word transducers is in PSPACE.
    Sougata Bose, Anca Muscholl, Vincent Penelle and Gabriele Puppis.
    Arxiv
  • [d2] Undecidability of MSO+"ultimately periodic".
    Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle and Sreejith A.V.
    Arxiv
  • [d1] Annotated Stack Trees.
    Matthew Hague and Vincent Penelle.
    Arxiv