default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Penelle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Prince Mathew
, Vincent Penelle, Prakash Saivasan, A. V. Sreejith:
Weighted One-Deterministic-Counter Automata. FSTTCS 2023: 39:1-39:23- [i6]Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith:
One Deterministic-Counter Automata. CoRR abs/2301.13456 (2023) - 2020
- [j2]Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith:
Undecidability of a weak version of MSO+U. Log. Methods Comput. Sci. 16(1) (2020)
2010 – 2019
- 2019
- [c8]Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
On Synthesis of Resynchronizers for Transducers. MFCS 2019: 69:1-69:14 - [i5]Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
On Synthesis of Resynchronizers for Transducers. CoRR abs/1906.08688 (2019) - 2018
- [c7]Sougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
Origin-Equivalence of Two-Way Word Transducers Is in PSPACE. FSTTCS 2018: 22:1-22:18 - [c6]Vincent Penelle, Sylvain Salvati, Grégoire Sutre:
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. FSTTCS 2018: 44:1-44:20 - [c5]Matthew Hague, Vincent Penelle:
Constrained Dynamic Tree Networks. RP 2018: 45-58 - [i4]Sougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
Origin-equivalence of two-way word transducers is in PSPACE. CoRR abs/1807.08053 (2018) - [i3]Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith:
Undecidability of MSO+"ultimately periodic". CoRR abs/1807.08506 (2018) - 2017
- [j1]Vincent Penelle:
Rewriting Higher-Order Stack Trees. Theory Comput. Syst. 61(2): 536-580 (2017) - [c4]Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle:
Which Classes of Origin Graphs Are Generated by Transducers. ICALP 2017: 114:1-114:13 - 2015
- [b1]Vincent Penelle:
Réécriture d'arbres de piles et traces de systèmes à compteurs. (Ground stack tree rewriting and traces of counter systems). University of Paris-Est, France, 2015 - [c3]Vincent Penelle:
Rewriting Higher-Order Stack Trees. CSR 2015: 364-397 - [i2]Vincent Penelle:
Rewriting Higher-Order Stack Trees. CoRR abs/1502.04653 (2015) - [i1]Matthew Hague, Vincent Penelle:
Annotated Stack Trees. CoRR abs/1502.05873 (2015) - 2014
- [c2]Jérôme Leroux, Vincent Penelle, Grégoire Sutre:
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems. ATVA 2014: 248-263 - 2013
- [c1]Jérôme Leroux, Vincent Penelle, Grégoire Sutre:
On the Context-Freeness Problem for Vector Addition Systems. LICS 2013: 43-52
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
