Approximate comparison of distance automata. - Thomas Colcombet; Laure Daviaud (STACS, 2013)

Size-Change Abstraction and Max-Plus Automata. - Thomas Colcombet; Laure Daviaud; Florian Zuleger (MFCS (1), 2014)

A Generalised Twinning Property for Minimisation of Cost Register Automata. - Laure Daviaud; Pierre-Alain Reynier; Jean-Marc Talbot (LICS, 2016)

Varieties of Cost Functions. - Laure Daviaud; Denis Kuperberg; Jean-Éric Pin (STACS, 2016)

Approximate Comparison of Functions Computed by Distance Automata. - Thomas Colcombet; Laure Daviaud (Theory Comput. Syst., 2016)

Automata and Program Analysis. - Thomas Colcombet; Laure Daviaud; Florian Zuleger (FCT, 2017)

Degree of Sequentiality of Weighted Automata. - Laure Daviaud; Ismaël Jecker; Pierre-Alain Reynier; Didier Villevalois (FoSSaCS, 2017)

Which Classes of Origin Graphs Are Generated by Transducers. - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle (ICALP, 2017)

Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices. - Laure Daviaud; Pierre Guillon 001; Glenn Merlet (MFCS, 2017)

The Shortest Identities for Max-Plus Automata with Two States. - Laure Daviaud; Marianne Johnson (MFCS, 2017)

When is Containment Decidable for Probabilistic Automata?. - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001; Filip Mazowiecki; Guillermo A. Pérez 001; James Worrell 001 (ICALP, 2018)

Regular and First-Order List Functions. - Mikolaj Bojanczyk; Laure Daviaud; Shankara Narayanan Krishna (LICS, 2018)

A pseudo-quasi-polynomial algorithm for mean-payoff parity games. - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001 (LICS, 2018)

A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001 (CoRR, 2018)

Undecidability of MSO+"ultimately periodic". - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle; A. V. Sreejith (CoRR, 2018)

Classes of languages generated by the Kleene star of a word. - Laure Daviaud; Charles Paperman (Inf. Comput., 2018)

Alternating Weak Automata from Universal Trees. - Laure Daviaud; Marcin Jurdzinski; Karoliina Lehtinen (CONCUR, 2019)

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. - Wojciech Czerwinski; Laure Daviaud; Nathanaël Fijalkow; Marcin Jurdzinski; Ranko Lazic 001; Pawel Parys (SODA, 2019)

The Strahler Number of a Parity Game. - Laure Daviaud; Marcin Jurdzinski; K. S. Thejaswini (ICALP, 2020)

Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases. - Laure Daviaud (LATA, 2020)

Undecidability of a weak version of MSO+U. - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle; A. V. Sreejith (Log. Methods Comput. Sci., 2020)

Register complexity and determinisation of max-plus automata. - Laure Daviaud (ACM SIGLOG News, 2020)

When are emptiness and containment decidable for probabilistic automata? - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001; Filip Mazowiecki; Guillermo A. Pérez 001; James Worrell 001 (J. Comput. Syst. Sci., 2021)

Formal and Empirical Studies of Counting Behaviour in ReLU RNNs. - Nadine El-Naggar; Andrew Ryzhikov; Laure Daviaud; Pranava Madhyastha; Tillman Weyde (ICGI, 2023)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). - Laure Daviaud; David Purser (LICS, 2023)

Universality and Forall-Exactness of Cost Register Automata with Few Registers. - Laure Daviaud; Andrew Ryzhikov (MFCS, 2023)

Feasability of Learning Weighted Automata on a Semiring. - Laure Daviaud; Marianne Johnson (CoRR, 2023)