Projects per year
Personal profile
Academic Background
Theoretical Computer Science and Mathematics
For activities pre-2023, see cv
Key Research Interests
Formal Verification, Automata and Models of Computation, Logic, Automata Learning, Decidability
Postgraduate Research Opportunities
Prospective PhD students should contact me by email to discuss the project title, scope and how to apply.
Education/Academic qualification
Doctor of Philosophy, IRIF - CNRS/Université de Paris
Award Date: 22 Sep 2014
External positions
Visiting Research Fellow, City, University of London
1 Jun 2023 → …
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 1 Finished
-
Formal and Empirical Studies of Counting Behaviour in ReLU RNNs
El-Naggar, N., Ryzhikov, A., Daviaud, L., Madhyastha, P. & Weyde, T., 2023, The 16th International Conference on Grammatical Inference: ICGI 2023. Vol. 217. p. 199-222 24 p. (Proceedings of Machine Learning Research).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile16 Downloads (Pure) -
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
Daviaud, L. & Purser, D., 14 Jul 2023, 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). The Institute of Electrical and Electronics Engineers (IEEE), (Proceedings - Symposium on Logic in Computer Science; vol. 2023-June).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
Universality and Forall-Exactness of Cost Register Automata with Few Registers
Daviaud, L. & Ryzhikov, A., Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science : MFCS 2023. Leroux, J., Lombardy, S. & Peleg, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 272. p. 40:1-40:15 15 p. 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile13 Downloads (Pure) -
When are emptiness and containment decidable for probabilistic automata?
Daviaud, L., Jurdziński, M., Lazić, R., Mazowiecki, F., Pérez, G. A. & Worrell, J., Aug 2021, In: Journal of Computer and System Sciences. 119, p. 78-96 19 p.Research output: Contribution to journal › Article › peer-review
Open Access6 Citations (Scopus) -
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases
Daviaud, L., 2020, LATA 2020: Language and Automata Theory and Applications. Leporati, A., Martín-Vide, C., Shapira, D. & Zandron, C. (eds.). Springer, p. 17-32 16 p. (Lecture Notes in Computer Science; vol. 12038).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile12 Downloads (Pure)
Activities
-
33nd EACSL Annual Conference on Computer Science Logic (CSL) 2025
Laure Daviaud (Member of programme committee)
2025Activity: Participating in or organising an event › Participation in conference
-
28th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) 2025
Laure Daviaud (Member of programme committee)
2025Activity: Participating in or organising an event › Participation in conference
-
Highlights of Logic, Games and Automata
Laure Daviaud (Invited speaker)
16 Sep 2024 → 20 Sep 2024Activity: Participating in or organising an event › Invited talk
-
GT Data, Automata, Algebra & Logic (DAAL)
Laure Daviaud (Invited speaker)
26 Apr 2024Activity: Participating in or organising an event › Invited talk
-
44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2024
Laure Daviaud (Member of programme committee)
2024Activity: Participating in or organising an event › Participation in conference