Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Nathan Lhote
@article{DBLP:journals/corr/abs-2307-13505, author = {Yahia Idriss Benalioua and Nathan Lhote and Pierre{-}Alain Reynier}, title = {Register Minimization of Cost Register Automata over a Field}, journal = {CoRR}, volume = {abs/2307.13505}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.13505}, doi = {10.48550/ARXIV.2307.13505}, eprinttype = {arXiv}, eprint = {2307.13505}, timestamp = {Tue, 01 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-13505.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BarloyFLM22, author = {Corentin Barloy and Nathana{\"{e}}l Fijalkow and Nathan Lhote and Filip Mazowiecki}, title = {A robust class of linear recurrence sequences}, journal = {Inf. Comput.}, volume = {289}, number = {Part}, pages = {104964}, year = {2022}, url = {https://doi.org/10.1016/j.ic.2022.104964}, doi = {10.1016/J.IC.2022.104964}, timestamp = {Tue, 29 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BarloyFLM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmcs/DaveFKL22, author = {Vrunda Dave and Emmanuel Filiot and Shankara Narayanan Krishna and Nathan Lhote}, title = {Synthesis of Computable Regular Functions of Infinite Words}, journal = {Log. Methods Comput. Sci.}, volume = {18}, number = {2}, year = {2022}, url = {https://doi.org/10.46298/lmcs-18(2:23)2022}, doi = {10.46298/LMCS-18(2:23)2022}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/lmcs/DaveFKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmcs/ExibardFLR22, author = {L{\'{e}}o Exibard and Emmanuel Filiot and Nathan Lhote and Pierre{-}Alain Reynier}, title = {Computability of Data-Word Transductions over Different Data Domains}, journal = {Log. Methods Comput. Sci.}, volume = {18}, number = {3}, year = {2022}, url = {https://doi.org/10.46298/lmcs-18(3:9)2022}, doi = {10.46298/LMCS-18(3:9)2022}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/lmcs/ExibardFLR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csl/BaudruDLMRT22, author = {Nicolas Baudru and Louis{-}Marie Dando and Nathan Lhote and Benjamin Monmege and Pierre{-}Alain Reynier and Jean{-}Marc Talbot}, editor = {Florin Manea and Alex Simpson}, title = {Weighted Automata and Expressions over Pre-Rational Monoids}, booktitle = {30th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2022, February 14-19, 2022, G{\"{o}}ttingen, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {216}, pages = {6:1--6:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.CSL.2022.6}, doi = {10.4230/LIPICS.CSL.2022.6}, timestamp = {Thu, 27 Jan 2022 17:26:21 +0100}, biburl = {https://dblp.org/rec/conf/csl/BaudruDLMRT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-07038, author = {L{\'{e}}o Exibard and Emmanuel Filiot and Nathan Lhote and Pierre{-}Alain Reynier}, title = {Computability of Data-Word Transductions over Different Data Domains}, journal = {CoRR}, volume = {abs/2101.07038}, year = {2021}, url = {https://arxiv.org/abs/2101.07038}, eprinttype = {arXiv}, eprint = {2101.07038}, timestamp = {Fri, 22 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-07038.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-12395, author = {Nicolas Baudru and Louis{-}Marie Dando and Nathan Lhote and Benjamin Monmege and Pierre{-}Alain Reynier and Jean{-}Marc Talbot}, title = {Weighted Automata and Expressions over Pre-Rational Monoids}, journal = {CoRR}, volume = {abs/2110.12395}, year = {2021}, url = {https://arxiv.org/abs/2110.12395}, eprinttype = {arXiv}, eprint = {2110.12395}, timestamp = {Thu, 28 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-12395.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/concur/DaveFKL20, author = {Vrunda Dave and Emmanuel Filiot and Shankara Narayanan Krishna and Nathan Lhote}, editor = {Igor Konnov and Laura Kov{\'{a}}cs}, title = {Synthesis of Computable Regular Functions of Infinite Words}, booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)}, series = {LIPIcs}, volume = {171}, pages = {43:1--43:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.43}, doi = {10.4230/LIPICS.CONCUR.2020.43}, timestamp = {Mon, 21 Dec 2020 13:23:22 +0100}, biburl = {https://dblp.org/rec/conf/concur/DaveFKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csl/BarloyFLM20, author = {Corentin Barloy and Nathana{\"{e}}l Fijalkow and Nathan Lhote and Filip Mazowiecki}, editor = {Maribel Fern{\'{a}}ndez and Anca Muscholl}, title = {A Robust Class of Linear Recurrence Sequences}, booktitle = {28th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2020, January 13-16, 2020, Barcelona, Spain}, series = {LIPIcs}, volume = {152}, pages = {9:1--9:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.CSL.2020.9}, doi = {10.4230/LIPICS.CSL.2020.9}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/csl/BarloyFLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/Lhote20, author = {Nathan Lhote}, editor = {Holger Hermanns and Lijun Zhang and Naoki Kobayashi and Dale Miller}, title = {Pebble Minimization of Polyregular Functions}, booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020}, pages = {703--712}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3373718.3394804}, doi = {10.1145/3373718.3394804}, timestamp = {Sat, 30 Sep 2023 09:52:07 +0200}, biburl = {https://dblp.org/rec/conf/lics/Lhote20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmcs/FiliotGL19, author = {Emmanuel Filiot and Olivier Gauwin and Nathan Lhote}, title = {Logical and Algebraic Characterizations of Rational Transductions}, journal = {Log. Methods Comput. Sci.}, volume = {15}, number = {4}, year = {2019}, url = {https://doi.org/10.23638/LMCS-15(4:16)2019}, doi = {10.23638/LMCS-15(4:16)2019}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/lmcs/FiliotGL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BojanczykKL19, author = {Mikolaj Bojanczyk and Sandra Kiefer and Nathan Lhote}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, title = {String-to-String Interpretations With Polynomial-Size Output}, booktitle = {46th International Colloquium on Automata, Languages, and Programming, {ICALP} 2019, July 9-12, 2019, Patras, Greece}, series = {LIPIcs}, volume = {132}, pages = {106:1--106:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.106}, doi = {10.4230/LIPICS.ICALP.2019.106}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BojanczykKL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/LhoteMS19, author = {Nathan Lhote and Vincent Michielini and Michal Skrzypczak}, editor = {Peter Rossmanith and Pinar Heggernes and Joost{-}Pieter Katoen}, title = {Uniformisation Gives the Full Strength of Regular Languages}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany}, series = {LIPIcs}, volume = {138}, pages = {61:1--61:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.61}, doi = {10.4230/LIPICS.MFCS.2019.61}, timestamp = {Fri, 30 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/LhoteMS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1905-13190, author = {Mikolaj Bojanczyk and Sandra Kiefer and Nathan Lhote}, title = {String-to-String Interpretations with Polynomial-Size Output}, journal = {CoRR}, volume = {abs/1905.13190}, year = {2019}, url = {http://arxiv.org/abs/1905.13190}, eprinttype = {arXiv}, eprint = {1905.13190}, timestamp = {Mon, 03 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1905-13190.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-04199, author = {Vrunda Dave and Emmanuel Filiot and Shankara Narayanan Krishna and Nathan Lhote}, title = {Deciding the Computability of Regular Functions over Infinite Words}, journal = {CoRR}, volume = {abs/1906.04199}, year = {2019}, url = {http://arxiv.org/abs/1906.04199}, eprinttype = {arXiv}, eprint = {1906.04199}, timestamp = {Fri, 14 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-04199.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1908-03890, author = {Corentin Barloy and Nathana{\"{e}}l Fijalkow and Nathan Lhote and Filip Mazowiecki}, title = {A Robust Class of Linear Recurrence Sequences}, journal = {CoRR}, volume = {abs/1908.03890}, year = {2019}, url = {http://arxiv.org/abs/1908.03890}, eprinttype = {arXiv}, eprint = {1908.03890}, timestamp = {Mon, 19 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1908-03890.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1910-06019, author = {Paulin Fournier and Nathan Lhote}, title = {Equivalence kernels of sequential functions and sequential observation synthesis}, journal = {CoRR}, volume = {abs/1910.06019}, year = {2019}, url = {http://arxiv.org/abs/1910.06019}, eprinttype = {arXiv}, eprint = {1910.06019}, timestamp = {Wed, 16 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1910-06019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/hal/Lhote18, author = {Nathan Lhote}, title = {Definability and synthesis of transductions. (D{\'{e}}finissabilit{\'{e}} et synth{\`{e}}se de transductions)}, school = {University of Bordeaux, France}, year = {2018}, url = {https://tel.archives-ouvertes.fr/tel-01960958}, timestamp = {Tue, 21 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/hal/Lhote18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/FiliotGLM18, author = {Emmanuel Filiot and Olivier Gauwin and Nathan Lhote and Anca Muscholl}, editor = {Sumit Ganguly and Paritosh K. Pandya}, title = {On Canonical Models for Rational Functions over Infinite Words}, booktitle = {38th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018, Ahmedabad, India}, series = {LIPIcs}, volume = {122}, pages = {30:1--30:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.30}, doi = {10.4230/LIPICS.FSTTCS.2018.30}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/FiliotGLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/DartoisFL18, author = {Luc Dartois and Emmanuel Filiot and Nathan Lhote}, editor = {Anuj Dawar and Erich Gr{\"{a}}del}, title = {Logics for Word Transductions with Synthesis}, booktitle = {Proceedings of the 33rd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2018, Oxford, UK, July 09-12, 2018}, pages = {295--304}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3209108.3209181}, doi = {10.1145/3209108.3209181}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lics/DartoisFL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DartoisFJL17, author = {Luc Dartois and Paulin Fournier and Isma{\"{e}}l Jecker and Nathan Lhote}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, title = {On Reversible Transducers}, booktitle = {44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {80}, pages = {113:1--113:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.113}, doi = {10.4230/LIPICS.ICALP.2017.113}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DartoisFJL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/FiliotJLPR17, author = {Emmanuel Filiot and Isma{\"{e}}l Jecker and Nathan Lhote and Guillermo A. P{\'{e}}rez and Jean{-}Fran{\c{c}}ois Raskin}, title = {On delay and regret determinization of max-plus automata}, booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2017, Reykjavik, Iceland, June 20-23, 2017}, pages = {1--12}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/LICS.2017.8005096}, doi = {10.1109/LICS.2017.8005096}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lics/FiliotJLPR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FiliotJLPR17, author = {Emmanuel Filiot and Isma{\"{e}}l Jecker and Nathan Lhote and Guillermo A. P{\'{e}}rez and Jean{-}Fran{\c{c}}ois Raskin}, title = {On Delay and Regret Determinization of Max-Plus Automata}, journal = {CoRR}, volume = {abs/1701.02903}, year = {2017}, url = {http://arxiv.org/abs/1701.02903}, eprinttype = {arXiv}, eprint = {1701.02903}, timestamp = {Thu, 08 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FiliotJLPR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DartoisFL17, author = {Luc Dartois and Emmanuel Filiot and Nathan Lhote}, title = {Decidable Logics for Transductions and Data Words}, journal = {CoRR}, volume = {abs/1701.03670}, year = {2017}, url = {http://arxiv.org/abs/1701.03670}, eprinttype = {arXiv}, eprint = {1701.03670}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DartoisFL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DartoisFJL17, author = {Luc Dartois and Paulin Fournier and Isma{\"{e}}l Jecker and Nathan Lhote}, title = {On Reversible Transducers}, journal = {CoRR}, volume = {abs/1702.07157}, year = {2017}, url = {http://arxiv.org/abs/1702.07157}, eprinttype = {arXiv}, eprint = {1702.07157}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DartoisFJL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FiliotGL17, author = {Emmanuel Filiot and Olivier Gauwin and Nathan Lhote}, title = {Logical and Algebraic Characterizations of Rational Transductions}, journal = {CoRR}, volume = {abs/1705.03726}, year = {2017}, url = {http://arxiv.org/abs/1705.03726}, eprinttype = {arXiv}, eprint = {1705.03726}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FiliotGL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/FiliotGL16, author = {Emmanuel Filiot and Olivier Gauwin and Nathan Lhote}, editor = {Akash Lal and S. Akshay and Saket Saurabh and Sandeep Sen}, title = {Aperiodicity of Rational Functions Is PSPACE-Complete}, booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016, Chennai, India}, series = {LIPIcs}, volume = {65}, pages = {13:1--13:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.13}, doi = {10.4230/LIPICS.FSTTCS.2016.13}, timestamp = {Tue, 30 Nov 2021 13:29:05 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/FiliotGL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/FiliotGL16, author = {Emmanuel Filiot and Olivier Gauwin and Nathan Lhote}, editor = {Martin Grohe and Eric Koskinen and Natarajan Shankar}, title = {First-order definability of rational transductions: An algebraic approach}, booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} '16, New York, NY, USA, July 5-8, 2016}, pages = {387--396}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2933575.2934520}, doi = {10.1145/2933575.2934520}, timestamp = {Wed, 11 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lics/FiliotGL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Lhote15, author = {Nathan Lhote}, title = {Towards an algebraic characterization of rational word functions}, journal = {CoRR}, volume = {abs/1506.06497}, year = {2015}, url = {http://arxiv.org/abs/1506.06497}, eprinttype = {arXiv}, eprint = {1506.06497}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Lhote15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.