Laure Daviaud

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 33

Top Topics

Empirical Studies

Probabilistic Automata

Top Venues

Publications

Laure Daviaud, David Purser
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). LICS (2023)
Laure Daviaud, David Purser
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). CoRR (2023)
Laure Daviaud, Andrew Ryzhikov
Universality and Forall-Exactness of Cost Register Automata with Few Registers. MFCS (2023)
Laure Daviaud, Marianne Johnson
Feasability of Learning Weighted Automata on a Semiring. CoRR (2023)
Nadine El-Naggar, Andrew Ryzhikov, Laure Daviaud, Pranava Madhyastha, Tillman Weyde
Formal and Empirical Studies of Counting Behaviour in ReLU RNNs. ICGI (2023)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. 119 (2021)
Laure Daviaud
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases. LATA (2020)
Laure Daviaud
Register complexity and determinisation of max-plus automata. ACM SIGLOG News 7 (2) (2020)
Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini
The Strahler Number of a Parity Game. ICALP (2020)
Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini
The Strahler number of a parity game. CoRR (2020)
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
Undecidability of a weak version of MSO+U. Log. Methods Comput. Sci. 16 (1) (2020)
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA (2019)
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
Alternating Weak Automata from Universal Trees. CONCUR (2019)
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
Alternating Weak Automata from Universal Trees. CoRR (2019)
Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna
Regular and First-Order List Functions. LICS (2018)
Mikolaj Bojanczyk, Laure Daviaud, Krishna Shankara Narayanan
Regular and First Order List Functions. CoRR (2018)
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
Undecidability of MSO+"ultimately periodic". CoRR (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. CoRR (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic
A pseudo-quasi-polynomial algorithm for mean-payoff parity games. LICS (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When is Containment Decidable for Probabilistic Automata?. ICALP (2018)
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. CoRR (2018)
Laure Daviaud, Charles Paperman
Classes of languages generated by the Kleene star of a word. Inf. Comput. 262 (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When is Containment Decidable for Probabilistic Automata? CoRR (2018)
Thomas Colcombet, Laure Daviaud, Florian Zuleger
Automata and Program Analysis. FCT (2017)
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
Degree of sequentiality of weighted automata. CoRR (2017)
Laure Daviaud, Pierre Guillon, Glenn Merlet
Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices. MFCS (2017)
Laure Daviaud, Marianne Johnson
The Shortest Identities for Max-Plus Automata with Two States. MFCS (2017)
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle
Which Classes of Origin Graphs Are Generated by Transducers. ICALP (2017)
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
Degree of Sequentiality of Weighted Automata. FoSSaCS (2017)
Thomas Colcombet, Laure Daviaud
Approximate Comparison of Functions Computed by Distance Automata. Theory Comput. Syst. 58 (4) (2016)
Laure Daviaud, Pierre Guillon, Glenn Merlet
Comparison of max-plus automata and joint spectral radius of tropical matrices. CoRR (2016)
Laure Daviaud, Denis Kuperberg, Jean-Éric Pin
Varieties of Cost Functions. STACS (2016)
Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot
A Generalised Twinning Property for Minimisation of Cost Register Automata. LICS (2016)
Laure Daviaud, Charles Paperman
Classes of Languages Generated by the Kleene Star of a Word. MFCS (1) (2015)
Thomas Colcombet, Laure Daviaud, Florian Zuleger
Size-Change Abstraction and Max-Plus Automata. MFCS (1) (2014)
Thomas Colcombet, Laure Daviaud
Approximate comparison of distance automata. STACS (2013)