Laure Daviaud

According to our database, Laure Daviaud authored at least 27 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

Feasability of Learning Weighted Automata on a Semiring.

Laure Daviaud, Marianne Johnson

CoRR, 2023

Universality and Forall-Exactness of Cost Register Automata with Few Registers.

Laure Daviaud, Andrew Ryzhikov

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).

Laure Daviaud, David Purser

LICS, 2023

Formal and Empirical Studies of Counting Behaviour in ReLU RNNs.

Nadine El-Naggar, Andrew Ryzhikov, Laure Daviaud, Pranava Madhyastha, Tillman Weyde

Proceedings of the International Conference on Grammatical Inference, 2023

2021

When are emptiness and containment decidable for probabilistic automata?

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell

J. Comput. Syst. Sci., 2021

2020

Register complexity and determinisation of max-plus automata.

Laure Daviaud

ACM SIGLOG News, 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

Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases.

Laure Daviaud

Proceedings of the Language and Automata Theory and Applications, 2020

The Strahler Number of a Parity Game.

Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

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, Pawel Parys

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Alternating Weak Automata from Universal Trees.

Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Classes of languages generated by the Kleene star of a word.

Laure Daviaud, Charles Paperman

Inf. Comput., 2018

Undecidability of MSO+"ultimately periodic".

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith

CoRR, 2018

A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games.

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic

CoRR, 2018

A pseudo-quasi-polynomial algorithm for mean-payoff parity games.

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Regular and First-Order List Functions.

Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

When is Containment Decidable for Probabilistic Automata?.

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

The Shortest Identities for Max-Plus Automata with Two States.

Laure Daviaud, Marianne Johnson

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices.

Laure Daviaud, Pierre Guillon, Glenn Merlet

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Which Classes of Origin Graphs Are Generated by Transducers.

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Degree of Sequentiality of Weighted Automata.

Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois

Proceedings of the Foundations of Software Science and Computation Structures, 2017

Automata and Program Analysis.

Thomas Colcombet, Laure Daviaud, Florian Zuleger

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

Approximate Comparison of Functions Computed by Distance Automata.

Thomas Colcombet, Laure Daviaud

Theory Comput. Syst., 2016

Varieties of Cost Functions.

Laure Daviaud, Denis Kuperberg, Jean-Éric Pin

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

A Generalised Twinning Property for Minimisation of Cost Register Automata.

Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2014

Size-Change Abstraction and Max-Plus Automata.

Thomas Colcombet, Laure Daviaud, Florian Zuleger

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Approximate comparison of distance automata.

Thomas Colcombet, Laure Daviaud

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013