Towards an algebraic characterization of rational word functions. - Nathan Lhote (CoRR, 2015)

Aperiodicity of Rational Functions Is PSPACE-Complete. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote (FSTTCS, 2016)

First-order definability of rational transductions: An algebraic approach. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote (LICS, 2016)

On Reversible Transducers. - Luc Dartois; Paulin Fournier; Ismaël Jecker; Nathan Lhote (ICALP, 2017)

On delay and regret determinization of max-plus automata. - Emmanuel Filiot; Ismaël Jecker; Nathan Lhote; Guillermo A. Pérez 001; Jean-François Raskin (LICS, 2017)

Decidable Logics for Transductions and Data Words. - Luc Dartois; Emmanuel Filiot; Nathan Lhote (CoRR, 2017)

On Canonical Models for Rational Functions over Infinite Words. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote; Anca Muscholl (FSTTCS, 2018)

Logics for Word Transductions with Synthesis. - Luc Dartois; Emmanuel Filiot; Nathan Lhote (LICS, 2018)

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

String-to-String Interpretations With Polynomial-Size Output. - Mikolaj Bojanczyk; Sandra Kiefer; Nathan Lhote (ICALP, 2019)

Uniformisation Gives the Full Strength of Regular Languages. - Nathan Lhote; Vincent Michielini; Michal Skrzypczak (MFCS, 2019)

Deciding the Computability of Regular Functions over Infinite Words. - Vrunda Dave; Emmanuel Filiot; Shankara Narayanan Krishna; Nathan Lhote (CoRR, 2019)

Equivalence kernels of sequential functions and sequential observation synthesis. - Paulin Fournier; Nathan Lhote (CoRR, 2019)

Logical and Algebraic Characterizations of Rational Transductions. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote (Log. Methods Comput. Sci., 2019)

Pebble Minimization of Polyregular Functions. - Nathan Lhote (LICS, 2020)

Weighted Automata and Expressions over Pre-Rational Monoids. - Nicolas Baudru; Louis-Marie Dando; Nathan Lhote; Benjamin Monmege; Pierre-Alain Reynier; Jean-Marc Talbot (CSL, 2022)

A robust class of linear recurrence sequences. - Corentin Barloy; Nathanaël Fijalkow; Nathan Lhote; Filip Mazowiecki (Inf. Comput., 2022)

Synthesis of Computable Regular Functions of Infinite Words. - Vrunda Dave; Emmanuel Filiot; Shankara Narayanan Krishna; Nathan Lhote (Log. Methods Comput. Sci., 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)

Register Minimization of Cost Register Automata over a Field. - Yahia Idriss Benalioua; Nathan Lhote; Pierre-Alain Reynier (CoRR, 2023)

Uniformisation of Regular Relations in First-Order Logic with Two Variables. - Nathan Lhote; Vincent Michielini; Michal Skrzypczak (LICS, 2024)

Minimizing Cost Register Automata over a Field. - Yahia Idriss Benalioua; Nathan Lhote; Pierre-Alain Reynier (MFCS, 2024)

A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson Ranks. - Karoliina Lehtinen; Nathan Lhote (ICALP, 2025)

Lexicographic Transductions of Finite Words. - Emmanuel Filiot; Nathan Lhote; Pierre-Alain Reynier (MFCS, 2025)

Well-Quasi-Orderings on Word Languages. - Nathan Lhote; Aliaume Lopez; Lia Schütze (CoRR, 2025)

The structure of polynomial growth for tree automata/transducers and MSO set queries. - Paul Gallot; Nathan Lhote; Lê Thành Dung Nguyên (CoRR, 2025)