Nathan Lhote

Orcid: 0000-0003-3303-5368

According to our database1, Nathan Lhote authored at least 22 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Minimizing Cost Register Automata over a Field.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Uniformisation of Regular Relations in First-Order Logic with Two Variables.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023
Register Minimization of Cost Register Automata over a Field.
CoRR, 2023

2022
Computability of Data-Word Transductions over Different Data Domains.
Log. Methods Comput. Sci., 2022

Synthesis of Computable Regular Functions of Infinite Words.
Log. Methods Comput. Sci., 2022

A robust class of linear recurrence sequences.
Inf. Comput., 2022

Weighted Automata and Expressions over Pre-Rational Monoids.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

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

2019
Logical and Algebraic Characterizations of Rational Transductions.
Log. Methods Comput. Sci., 2019

Equivalence kernels of sequential functions and sequential observation synthesis.
CoRR, 2019

Deciding the Computability of Regular Functions over Infinite Words.
CoRR, 2019

Uniformisation Gives the Full Strength of Regular Languages.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

String-to-String Interpretations With Polynomial-Size Output.
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).
PhD thesis, 2018

Logics for Word Transductions with Synthesis.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

On Canonical Models for Rational Functions over Infinite Words.
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.
CoRR, 2017

On delay and regret determinization of max-plus automata.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On Reversible Transducers.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
First-order definability of rational transductions: An algebraic approach.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Aperiodicity of Rational Functions Is PSPACE-Complete.
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.
CoRR, 2015


  Loading...