Nathan Lhote

According to our database, Nathan Lhote authored at least 20 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Register Minimization of Cost Register Automata over a Field.

Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier

CoRR, 2023

2022

Computability of Data-Word Transductions over Different Data Domains.

Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier

Log. Methods Comput. Sci., 2022

Synthesis of Computable Regular Functions of Infinite Words.

Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote

Log. Methods Comput. Sci., 2022

A robust class of linear recurrence sequences.

Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki

Inf. Comput., 2022

Weighted Automata and Expressions over Pre-Rational Monoids.

Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2020

Pebble Minimization of Polyregular Functions.

Nathan Lhote

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019

Logical and Algebraic Characterizations of Rational Transductions.

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote

Log. Methods Comput. Sci., 2019

Equivalence kernels of sequential functions and sequential observation synthesis.

Paulin Fournier, Nathan Lhote

CoRR, 2019

Deciding the Computability of Regular Functions over Infinite Words.

Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote

CoRR, 2019

Uniformisation Gives the Full Strength of Regular Languages.

Nathan Lhote, Vincent Michielini, Michal Skrzypczak

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

String-to-String Interpretations With Polynomial-Size Output.

Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Definability and synthesis of transductions. (Définissabilité et synthèse de transductions).

Nathan Lhote

PhD thesis, 2018

Logics for Word Transductions with Synthesis.

Luc Dartois, Emmanuel Filiot, Nathan Lhote

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

On Canonical Models for Rational Functions over Infinite Words.

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Decidable Logics for Transductions and Data Words.

Luc Dartois, Emmanuel Filiot, Nathan Lhote

CoRR, 2017

On delay and regret determinization of max-plus automata.

Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On Reversible Transducers.

Luc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

First-order definability of rational transductions: An algebraic approach.

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Aperiodicity of Rational Functions Is PSPACE-Complete.

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Towards an algebraic characterization of rational word functions.

Nathan Lhote

CoRR, 2015