Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Jean-Marc Talbot"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 134, Iss Proc. TTATT 2013, Pp 17-26 (2013)
Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. As trees and more generally hedges can be linearized
Externí odkaz:
https://doaj.org/article/61ac24a267784ee49efa113b8a0673a7
Autor:
Rachel Rignault-Bricard, Slimane Allali, Jean-Marc Talbot, Valentine Brousse, Florence Moulin, Olivier Hermine, Joséphine Brice, Melissa Taylor, Claire Heilbronner, Mariane de Montalembert, Thiago Trovati Maciel
Publikováno v:
Blood Adv
Key Points Sputum interleukin-6 (IL-6) level is high during acute chest syndrome (ACS) in pediatric sickle cell disease, supporting anti–IL-6 trials. Sputum IL-8, CCL2, and CCL3 levels are also high during ACS, possibly contributing to recruitment
Autor:
Jean-Marc Talbot, Emmanuel Filiot, Frédéric Servais, Pierre-Alain Reynier, Jean-François Raskin
Publikováno v:
Journal of Computer and System Sciences
Journal of Computer and System Sciences, Elsevier, 2018, 97, pp.147-181. ⟨10.1016/j.jcss.2018.05.002⟩
Journal of Computer and System Sciences, 2018, 97, pp.147-181. ⟨10.1016/j.jcss.2018.05.002⟩
Journal of Computer and System Sciences, Elsevier, 2018, 97, pp.147-181. ⟨10.1016/j.jcss.2018.05.002⟩
Journal of Computer and System Sciences, 2018, 97, pp.147-181. ⟨10.1016/j.jcss.2018.05.002⟩
Visibly pushdown transducers ( VPT ) extend visibly pushdown automata (VPA) with outputs. They read nested words, i.e. finite words on a structured alphabet partitioned into call, return and internal symbols, and produce output words, which are not n
Publikováno v:
Foundations of Software Science and Computation Structures. FoSSaCS 2019
FOSSACS 2019
FOSSACS 2019, Apr 2019, Pragues, Czech Republic. pp.189-206, ⟨10.1007/978-3-030-17127-8_11⟩
Bojańczyk M., Simpson A. Foundations of Software Science and Computation Structures. FoSSaCS 2019, Springer, pp.189-206, 2019, 978-3-030-17126-1. ⟨10.1007/978-3-030-17127-8_11⟩
Lecture Notes in Computer Science ISBN: 9783030171261
FoSSaCS
FOSSACS 2019
FOSSACS 2019, Apr 2019, Pragues, Czech Republic. pp.189-206, ⟨10.1007/978-3-030-17127-8_11⟩
Bojańczyk M., Simpson A. Foundations of Software Science and Computation Structures. FoSSaCS 2019, Springer, pp.189-206, 2019, 978-3-030-17126-1. ⟨10.1007/978-3-030-17127-8_11⟩
Lecture Notes in Computer Science ISBN: 9783030171261
FoSSaCS
International audience; In this paper, we investigate the complexity of the emptiness problem for Parikh automata equipped with a pushdown stack. Push-down Parikh automata extend pushdown automata with counters which can only be incremented and an ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39004ac20f7e14935f3d2909330ba432
https://hal.science/hal-02162279
https://hal.science/hal-02162279
Publikováno v:
Theoretical Computer Science. 578:13-29
We study the problem of trimming visibly pushdown automata (VPA). We first describe a polynomial time procedure which, given a visibly pushdown automaton that accepts only well-nested words, returns an equivalent visibly pushdown automaton that is tr
Autor:
Pierre-Alain Reynier, Jean-Marc Talbot
Publikováno v:
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science, 2016, 27 (02), pp.235-257. ⟨10.1142/S0129054116400086⟩
Developments in Language Theory ISBN: 9783319096971
Developments in Language Theory
International Journal of Foundations of Computer Science, 2016, 27 (02), pp.235-257. ⟨10.1142/S0129054116400086⟩
Developments in Language Theory ISBN: 9783319096971
Developments in Language Theory
International audience; Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced oto model transformations of nested words, i.e. words with a call/return structure. When outputs are also struc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fec3c5349078f70a4318291e3e79a80
https://hal.science/hal-03542594
https://hal.science/hal-03542594
Publikováno v:
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16)
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), 2016, Unknown, Unknown Region. pp.217--226, ⟨10.1145/2933575.2935315⟩
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), 2016, Unknown, Unknown Region. pp.217--226, ⟨10.1145/2933575.2935315⟩
Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three following mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16f7a89bfc3cee6178733f5a0f7e9f00
https://hal.science/hal-01475442
https://hal.science/hal-01475442
Publikováno v:
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16)
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), 2016, Unknown, Unknown Region. pp.857--866, ⟨10.1145/2933575.2934549⟩
LICS
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), 2016, Unknown, Unknown Region. pp.857--866, ⟨10.1145/2933575.2934549⟩
LICS
Weighted automata (WA) extend finite-state automata by associating with transitions weights from a semiring $\mathbb {S}$, defining functions from words to S. Recently, cost register automata (CRA) have been introduced as an alternative model to desc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::610124322b1442c08a8550fb2894edf3
https://hal.science/hal-01475441
https://hal.science/hal-01475441
Publikováno v:
PPDP
PPDP 2016
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, Sep 2016, Edinburgh, United Kingdom. pp.Pages 62-75
PPDP 2016
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, Sep 2016, Edinburgh, United Kingdom. pp.Pages 62-75
International audience; Administration of access control policies is a difficult task, especially in large organizations. We consider the problem of detecting whether administrative actions can yield in policies where some security goals are compromi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b13bcc4d9a5c4782c7593a2c4684213d
https://hal.science/hal-01452928
https://hal.science/hal-01452928
Publikováno v:
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015)
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Jul 2015, Kyoto, Japan. ⟨10.1007/978-3-662-47666-6_17⟩
Automata, Languages, and Programming ISBN: 9783662476659
Information and Computation
Information and Computation, Elsevier, 2018, 261, pp.311-335. ⟨10.1016/j.ic.2018.02.011⟩
Information and Computation, 2018, 261, pp.311-335. ⟨10.1016/j.ic.2018.02.011⟩
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Jul 2015, Kyoto, Japan. ⟨10.1007/978-3-662-47666-6_17⟩
Automata, Languages, and Programming ISBN: 9783662476659
Information and Computation
Information and Computation, Elsevier, 2018, 261, pp.311-335. ⟨10.1016/j.ic.2018.02.011⟩
Information and Computation, 2018, 261, pp.311-335. ⟨10.1016/j.ic.2018.02.011⟩
International audience; A tree transducer with origin translates an input tree into a pair of output tree and origin information. The origin information maps each node in the output tree to the unique node in the input tree that created it. In this w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c89b41ee93057b298444a31ce0a2e4a1
https://hal.archives-ouvertes.fr/hal-01285566
https://hal.archives-ouvertes.fr/hal-01285566