| 2025 | IJCCI | Extracting Deterministic Finite Automata from RNNs via Hyperplane Partitioning and Learning. | Sandamali Yashodhara Wickramasinghe, Jacob M. Howe, Laure Daviaud |
| 2023 | LICS | The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). | Laure Daviaud, David Purser |
| 2023 | MFCS | Universality and Forall-Exactness of Cost Register Automata with Few Registers. | Laure Daviaud, Andrew Ryzhikov |
| 2020 | ICALP | The Strahler Number of a Parity Game. | Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini |
| 2020 | LATA | Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases. | Laure Daviaud |
| 2019 | CONCUR | Alternating Weak Automata from Universal Trees. | Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen |
| 2019 | SODA | Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. | Wojciech Czerwinski, Laure Daviaud, Nathanal Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys |
| 2018 | ICALP | When is Containment Decidable for Probabilistic Automata?. | Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Prez, James Worrell |
| 2018 | LICS | Regular and First-Order List Functions. | Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna |
| 2018 | LICS | A pseudo-quasi-polynomial algorithm for mean-payoff parity games. | Laure Daviaud, Marcin Jurdzinski, Ranko Lazic |
| 2017 | FCT | Automata and Program Analysis. | Thomas Colcombet, Laure Daviaud, Florian Zuleger |
| 2017 | FOSSACS | Degree of Sequentiality of Weighted Automata. | Laure Daviaud, Ismal Jecker, Pierre-Alain Reynier, Didier Villevalois |
| 2017 | ICALP | Which Classes of Origin Graphs Are Generated by Transducers. | Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle |
| 2017 | MFCS | Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices. | Laure Daviaud, Pierre Guillon, Glenn Merlet |
| 2017 | MFCS | The Shortest Identities for Max-Plus Automata with Two States. | Laure Daviaud, Marianne Johnson |
| 2016 | LICS | A Generalised Twinning Property for Minimisation of Cost Register Automata. | Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot |
| 2016 | STACS | Varieties of Cost Functions. | Laure Daviaud, Denis Kuperberg, Jean-ric Pin |
| 2015 | MFCS | Classes of Languages Generated by the Kleene Star of a Word. | Laure Daviaud, Charles Paperman |
| 2014 | MFCS | Size-Change Abstraction and Max-Plus Automata. | Thomas Colcombet, Laure Daviaud, Florian Zuleger |
| 2013 | STACS | Approximate comparison of distance automata. | Thomas Colcombet, Laure Daviaud |