default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathan Lhote
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Nathan Lhote
, Vincent Michielini, Michal Skrzypczak:
Uniformisation of Regular Relations in First-Order Logic with Two Variables. LICS 2024: 54:1-54:13- [c13]Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier:
Minimizing Cost Register Automata over a Field. MFCS 2024: 23:1-23:15 - 2023
- [i12]Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier:
Register Minimization of Cost Register Automata over a Field. CoRR abs/2307.13505 (2023) - 2022
- [j4]Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A robust class of linear recurrence sequences. Inf. Comput. 289(Part): 104964 (2022) - [j3]Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Synthesis of Computable Regular Functions of Infinite Words. Log. Methods Comput. Sci. 18(2) (2022) - [j2]Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier:
Computability of Data-Word Transductions over Different Data Domains. Log. Methods Comput. Sci. 18(3) (2022) - [c12]Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot:
Weighted Automata and Expressions over Pre-Rational Monoids. CSL 2022: 6:1-6:16 - 2021
- [i11]Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier:
Computability of Data-Word Transductions over Different Data Domains. CoRR abs/2101.07038 (2021) - [i10]Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot:
Weighted Automata and Expressions over Pre-Rational Monoids. CoRR abs/2110.12395 (2021) - 2020
- [c11]Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Synthesis of Computable Regular Functions of Infinite Words. CONCUR 2020: 43:1-43:17 - [c10]Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A Robust Class of Linear Recurrence Sequences. CSL 2020: 9:1-9:16 - [c9]Nathan Lhote:
Pebble Minimization of Polyregular Functions. LICS 2020: 703-712
2010 – 2019
- 2019
- [j1]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Logical and Algebraic Characterizations of Rational Transductions. Log. Methods Comput. Sci. 15(4) (2019) - [c8]Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote:
String-to-String Interpretations With Polynomial-Size Output. ICALP 2019: 106:1-106:14 - [c7]Nathan Lhote, Vincent Michielini, Michal Skrzypczak:
Uniformisation Gives the Full Strength of Regular Languages. MFCS 2019: 61:1-61:13 - [i9]Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote:
String-to-String Interpretations with Polynomial-Size Output. CoRR abs/1905.13190 (2019) - [i8]Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Deciding the Computability of Regular Functions over Infinite Words. CoRR abs/1906.04199 (2019) - [i7]Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A Robust Class of Linear Recurrence Sequences. CoRR abs/1908.03890 (2019) - [i6]Paulin Fournier, Nathan Lhote:
Equivalence kernels of sequential functions and sequential observation synthesis. CoRR abs/1910.06019 (2019) - 2018
- [b1]Nathan Lhote:
Definability and synthesis of transductions. (Définissabilité et synthèse de transductions). University of Bordeaux, France, 2018 - [c6]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl:
On Canonical Models for Rational Functions over Infinite Words. FSTTCS 2018: 30:1-30:17 - [c5]Luc Dartois, Emmanuel Filiot, Nathan Lhote:
Logics for Word Transductions with Synthesis. LICS 2018: 295-304 - 2017
- [c4]Luc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote:
On Reversible Transducers. ICALP 2017: 113:1-113:12 - [c3]Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin:
On delay and regret determinization of max-plus automata. LICS 2017: 1-12 - [i5]Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin:
On Delay and Regret Determinization of Max-Plus Automata. CoRR abs/1701.02903 (2017) - [i4]Luc Dartois, Emmanuel Filiot, Nathan Lhote:
Decidable Logics for Transductions and Data Words. CoRR abs/1701.03670 (2017) - [i3]Luc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote:
On Reversible Transducers. CoRR abs/1702.07157 (2017) - [i2]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Logical and Algebraic Characterizations of Rational Transductions. CoRR abs/1705.03726 (2017) - 2016
- [c2]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Aperiodicity of Rational Functions Is PSPACE-Complete. FSTTCS 2016: 13:1-13:15 - [c1]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
First-order definability of rational transductions: An algebraic approach. LICS 2016: 387-396 - 2015
- [i1]Nathan Lhote:
Towards an algebraic characterization of rational word functions. CoRR abs/1506.06497 (2015)
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-08-27 21: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:
