On the Context-Freeness Problem for Vector Addition Systems. - Jérôme Leroux; Vincent Penelle; Grégoire Sutre (LICS, 2013)

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems. - Jérôme Leroux; Vincent Penelle; Grégoire Sutre (ATVA, 2014)

Annotated Stack Trees. - Matthew Hague; Vincent Penelle (CoRR, 2015)

Réécriture d'arbres de piles et traces de systèmes à compteurs. (Ground stack tree rewriting and traces of counter systems). - Vincent Penelle (2015)

Which Classes of Origin Graphs Are Generated by Transducers. - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle (ICALP, 2017)

Rewriting Higher-Order Stack Trees. - Vincent Penelle (Theory Comput. Syst., 2017)

Origin-Equivalence of Two-Way Word Transducers Is in PSPACE. - Sougata Bose; Anca Muscholl; Vincent Penelle; Gabriele Puppis (FSTTCS, 2018)

On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. - Vincent Penelle; Sylvain Salvati; Grégoire Sutre (FSTTCS, 2018)

Constrained Dynamic Tree Networks. - Matthew Hague; Vincent Penelle (RP, 2018)

Undecidability of MSO+"ultimately periodic". - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle; A. V. Sreejith (CoRR, 2018)

On Synthesis of Resynchronizers for Transducers. - Sougata Bose; Shankara Narayanan Krishna; Anca Muscholl; Vincent Penelle; Gabriele Puppis (MFCS, 2019)

Undecidability of a weak version of MSO+U. - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle; A. V. Sreejith (Log. Methods Comput. Sci., 2020)

Weighted One-Deterministic-Counter Automata. - Prince Mathew 001; Vincent Penelle; Prakash Saivasan; A. V. Sreejith (FSTTCS, 2023)

One Deterministic-Counter Automata. - Prince Mathew 001; Vincent Penelle; Prakash Saivasan; A. V. Sreejith (CoRR, 2023)

Equivalence of Deterministic Weighted Real-Time One-Counter Automata. - Prince Mathew 001; Vincent Penelle; Prakash Saivasan; A. V. Sreejith (ICLA, 2025)

Learning Real-Time One-Counter Automata Using Polynomially Many Queries. - Prince Mathew 001; Vincent Penelle; A. V. Sreejith (TACAS (1), 2025)

Learning Deterministic One-Counter Automata in Polynomial Time. - Prince Mathew 001; Vincent Penelle; A. V. Sreejith (CoRR, 2025)