Zobrazeno 1 - 9 of 9 pro vyhledávání: '"Luc Dartois"'
2
SD-Regular Transducer Expressions for Aperiodic Transformations
Autor: Shankara Narayanan Krishna, Luc Dartois, Paul Gastin
Publikováno v: 36th Annual Symposium on Logic in Computer Science (LICS'2021)
36th Annual Symposium on Logic in Computer Science (LICS'2021), Jun 2021, Rome, Italy. ⟨10.1109/LICS52264.2021.9470738⟩
LICS
FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order definable functions. In this paper, we solve the long standing open problem of expressions capt
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bc470d3e36a2b05bb8cb0a08fa516c0
https://hal.science/hal-03283013
Zobrazit plný text záznamu
3
Two-Way Parikh Automata with a Visibly Pushdown Stack
Autor: Emmanuel Filiot, Jean-Marc Talbot, Luc Dartois
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
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
Zobrazit plný text záznamu
4
Logics for Word Transductions with Synthesis
Autor: Nathan Lhote, Emmanuel Filiot, Luc Dartois
Publikováno v: LICS
We introduce a logic, called LT, to express properties of transductions, i.e. binary relations from input to output (finite) words. In LT, the input/output dependencies are modelled via an origin function which associates to any position of the outpu
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::994bbd40e7fb1afb021117654f6b9193
http://arxiv.org/abs/1701.03670
Zobrazit plný text záznamu
5
Two-Way Visibly Pushdown Automata and Transducers
Autor: Pierre-Alain Reynier, Jean-Marc Talbot, Luc Dartois, Emmanuel Filiot
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⟩
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
Zobrazit plný text záznamu
6
Aperiodic String Transducers
Autor: Ismaël Jecker, Luc Dartois, Pierre-Alain Reynier
Publikováno v: Developments in Language Theory ISBN: 9783662531310
DLT
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science, World Scientific Publishing, 2018
Proc. 20th International Conference on Developments in Language Theory (DLT 2016)
Proc. 20th International Conference on Developments in Language Theory (DLT 2016), 2016, Unknown, Unknown Region. pp.125-137, ⟨10.1007/978-3-662-53132-7_11⟩
International Journal of Foundations of Computer Science, 2018
Regular string-to-string functions enjoy a nice triple characterization through deterministic two-way transducers $$\mathrm {2DFT}$$, streaming string transducers $$\mathrm {SST}$$ and $$\mathrm {MSO}$$ definable functions. This result has recently b
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d47cfb96cf386fefce7b4946c959bff
http://arxiv.org/abs/1506.04059
Zobrazit plný text záznamu
7
Alternation Hierarchies of First Order Logic with Regular Predicates
Autor: Charles Paperman, Luc Dartois
Publikováno v: Fundamentals of Computation Theory ISBN: 9783319221762
FCT
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with regular numerical predicates. In this paper, we focus on the quantifier alternation hierarchies of first order logic. We ob
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::45ebde05aa76de5d617485895042ec7d
https://doi.org/10.1007/978-3-319-22177-9_13
Zobrazit plný text záznamu
8
Rankers over Infinite Words
Autor: Luc Dartois, Alexander Lauser, Manfred Kufleitner
Publikováno v: Developments in Language Theory ISBN: 9783642144547
We consider the fragments FO2, Σ2 ∩FO2, Π2 ∩FO2, and Δ2 of first-order logic FO[
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b1922f4e2eca31d2f6e1dd53938a3bc2
https://doi.org/10.1007/978-3-642-14455-4_15
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje