Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Penelle, Vincent"'
We introduce weighted one-deterministic-counter automata (ODCA). These are weighted one-counter automata (OCA) with the property of counter-determinacy, meaning that all paths labelled by a given word starting from the initial configuration have the
Externí odkaz:
http://arxiv.org/abs/2301.13456
Autor:
Bose, Sougata, Krishna, Shankara Narayanan, Muscholl, Anca, Penelle, Vincent, Puppis, Gabriele
We study two formalisms that allow to compare transducers over words under origin semantics: rational and regular resynchronizers, and show that the former are captured by the latter. We then consider some instances of the following synthesis problem
Externí odkaz:
http://arxiv.org/abs/1906.08688
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 1 (February 11, 2020) lmcs:5059
We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing that adding
Externí odkaz:
http://arxiv.org/abs/1807.08506
We consider equivalence and containment problems for word transductions. These problems are known to be undecidable when the transductions are relations between words realized by non-deterministic transducers, and become decidable when restricting to
Externí odkaz:
http://arxiv.org/abs/1807.08053
Autor:
Penelle, Vincent
Dans cette thèse, nous nous attachons à étudier des classes de graphes infinis et leurs propriétés, Notamment celles de vérification de modèles, d'accessibilité et de langages reconnus.Nous définissons une notion d'arbres de piles ainsi qu'u
Externí odkaz:
http://www.theses.fr/2015PESC1122/document
Autor:
Hague, Matthew, Penelle, Vincent
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification. We study Ground Annotated Stack Tree Rewrite Systems -- a tree rewrit
Externí odkaz:
http://arxiv.org/abs/1502.05873
Autor:
Penelle, Vincent
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for monadic seco
Externí odkaz:
http://arxiv.org/abs/1502.04653
We introduce one deterministic-counter automata (ODCA), which are one-counter automata where all runs labelled by a given word have the same counter effect, a property we call counter-determinacy. ODCAs are an extension of visibly one-counter automat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::831b10cbcb1a7e91be79bce06f9acf45
http://arxiv.org/abs/2301.13456
http://arxiv.org/abs/2301.13456
Autor:
Labbé, Sébastien, Penelle, Vincent, Mishna, Marni, Johansson, Fredrik, Bonamy, Marthe, Leroux, Jérôme, Goaoc, Xavier, Penev, Irena, Schmitz, Sylvain, Caruso, Xavier
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9da97bbbe29b9cf01b05e9c8ffc5a95c
https://hal.archives-ouvertes.fr/hal-03431823
https://hal.archives-ouvertes.fr/hal-03431823
Autor:
Penelle, Vincent
Publikováno v:
Theory of Computing Systems. Aug2017, Vol. 61 Issue 2, p536-580. 45p.
