Vincent Penelle

According to our database, Vincent Penelle authored at least 14 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

One Deterministic-Counter Automata.

Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith

CoRR, 2023

Weighted One-Deterministic-Counter Automata.

Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2020

Undecidability of a weak version of MSO+U.

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith

Log. Methods Comput. Sci., 2020

2019

On Synthesis of Resynchronizers for Transducers.

Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Undecidability of MSO+"ultimately periodic".

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith

CoRR, 2018

Constrained Dynamic Tree Networks.

Matthew Hague, Vincent Penelle

Proceedings of the Reachability Problems - 12th International Conference, 2018

On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems.

Vincent Penelle, Sylvain Salvati, Grégoire Sutre

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Origin-Equivalence of Two-Way Word Transducers Is in PSPACE.

Sougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Rewriting Higher-Order Stack Trees.

Vincent Penelle

Theory Comput. Syst., 2017

Which Classes of Origin Graphs Are Generated by Transducers.

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2015

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

Vincent Penelle

PhD thesis, 2015

Annotated Stack Trees.

Matthew Hague, Vincent Penelle

CoRR, 2015

2014

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems.

Jérôme Leroux, Vincent Penelle, Grégoire Sutre

Proceedings of the Automated Technology for Verification and Analysis, 2014

2013

On the Context-Freeness Problem for Vector Addition Systems.

Jérôme Leroux, Vincent Penelle, Grégoire Sutre

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013