Laure Daviaud

Orcid: 0000-0002-9220-7118

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Feasability of Learning Weighted Automata on a Semiring.
CoRR, 2023

Universality and Forall-Exactness of Cost Register Automata with Few Registers.
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).
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Formal and Empirical Studies of Counting Behaviour in ReLU RNNs.
Proceedings of the International Conference on Grammatical Inference, 2023

2021
When are emptiness and containment decidable for probabilistic automata?
J. Comput. Syst. Sci., 2021

2020
Register complexity and determinisation of max-plus automata.
ACM SIGLOG News, 2020

Undecidability of a weak version of MSO+U.
Log. Methods Comput. Sci., 2020

Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases.
Proceedings of the Language and Automata Theory and Applications, 2020

The Strahler Number of a Parity Game.
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.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Alternating Weak Automata from Universal Trees.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Classes of languages generated by the Kleene star of a word.
Inf. Comput., 2018

Undecidability of MSO+"ultimately periodic".
CoRR, 2018

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

A pseudo-quasi-polynomial algorithm for mean-payoff parity games.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Regular and First-Order List Functions.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

When is Containment Decidable for Probabilistic Automata?.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
The Shortest Identities for Max-Plus Automata with Two States.
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.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Which Classes of Origin Graphs Are Generated by Transducers.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Degree of Sequentiality of Weighted Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Automata and Program Analysis.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Approximate Comparison of Functions Computed by Distance Automata.
Theory Comput. Syst., 2016

Varieties of Cost Functions.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

A Generalised Twinning Property for Minimisation of Cost Register Automata.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2014
Size-Change Abstraction and Max-Plus Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Approximate comparison of distance automata.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013


  Loading...