Vincent Penelle

Consultez aussi ma page sur dblp pour une liste officielle

Thèse :

Publications dans une conférence internationale :

  • [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
    Télécharger les transparents ; Accéder à l’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.
    Télécharger les transparents ; 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. Télécharger les transparents ; 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.
    Télécharger les transparents ; HAL

Publications dans un journal :

Autres :

  • [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