Laure Daviaud

Search results

• 2023

  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 Access

  File
  1 Citation (Scopus)

  25 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 Access

  File
  21 Downloads (Pure)
• 2020

  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 Access

  File
  28 Downloads (Pure)

• The Strahler number of a parity game

  Daviaud, L., Jurdziński, M. & Thejaswini, K. S., 1 Jun 2020, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Czumaj, A., Dawar, A. & Merelli, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 123. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access

  File
  8 Citations (Scopus)

  7 Downloads (Pure)
• 2019

  Alternating weak automata from universal trees

  Daviaud, L., Jurdziński, M. & Lehtinen, K., Aug 2019, 30th International Conference on Concurrency Theory, CONCUR 2019. Fokkink, W. & van Glabbeek, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 18. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 140).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access
  9 Citations (Scopus)

• Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games

  Czerwinski, W., Daviaud, L., Fijalkow, N., Jurdzinski, M., Lazić, R. & Parys, P., 2019, Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics (SIAM), p. 2333-2349 17 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access
  27 Citations (Scopus)
• 2018

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

  Daviaud, L., Jurdziński, M. & Lazić, R., 9 Jul 2018, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018. The Institute of Electrical and Electronics Engineers (IEEE), p. 325-334 10 p. (Proceedings - Symposium on Logic in Computer Science).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
  19 Citations (Scopus)

• Regular and first-order list functions

  Bojańczyk, M., Daviaud, L. & Krishna, S. N., 9 Jul 2018, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018. The Institute of Electrical and Electronics Engineers (IEEE), p. 125-134 10 p. (Proceedings - Symposium on Logic in Computer Science).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
  15 Citations (Scopus)

• When is containment decidable for probabilistic automata?

  Daviaud, L., Jurdziński, M., Lazić, R., Mazowiecki, F., Pérez, G. A. & Worrell, J., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 121. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access
  14 Citations (Scopus)
• 2017

  Automata and Program Analysis

  Colcombet, T., Daviaud, L. & Zuleger, F., 2017, FCT 2017: Fundamentals of Computation Theory. Klasing, R. & Zeitoun, M. (eds.). Springer-Verlag Berlin Heidelberg, p. 3-10 8 p. (Lecture Notes in Computer Science ; vol. 10472).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
  2 Citations (Scopus)

• Comparison of max-plus automata and joint spectral radius of tropical matrices

  Daviaud, L., Guillon, P. & Merlet, G., 1 Nov 2017, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Larsen, K. G., Raskin, J-F. & Bodlaender, H. L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 83).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access
  5 Citations (Scopus)

• Degree of Sequentiality of Weighted Automata

  Daviaud, L., Jecker, I., Reynier, P-A. & Villevalois, D., 2017, FoSSaCS 2017: Foundations of Software Science and Computation Structures. Esparza, J. & Murawski, A. S. (eds.). Springer-Verlag Berlin Heidelberg, p. 215-230 16 p. (Lecture Notes in Computer Science; vol. 10203).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
  11 Citations (Scopus)

• The shortest identities for max-plus automata with two states

  Daviaud, L. & Johnson, M., 1 Nov 2017, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Larsen, K. G., Raskin, J-F. & Bodlaender, H. L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 83).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access
  5 Citations (Scopus)

• Which classes of origin graphs are generated by transducers?

  Bojanczyk, M., Daviaud, L., Guillon, B. & Penelle, V., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 114. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access
  16 Citations (Scopus)
• 2016

  A Generalised Twinning Property for Minimisation of Cost Register Automata

  Daviaud, L., Reynier, P-A. & Talbot, J-M., Jul 2016, Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016. The Institute of Electrical and Electronics Engineers (IEEE), p. 857-866 10 p. (Proceedings - Symposium on Logic in Computer Science; vol. 05-08-July-2016).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
  20 Citations (Scopus)

• Varieties of cost functions

  Daviaud, L., Kuperberg, D. & Pin, J. É., 1 Feb 2016, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. Vollmer, H. & Ollinger, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 47).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access
  4 Citations (Scopus)
• 2015

  Classes of Languages Generated by the Kleene Star of a Word

  Daviaud, L. & Paperman, C., 2015, MFCS 2015: Mathematical Foundations of Computer Science 2015. Italiano, G. F., Pighizzini, G. & Sannella, D. T. (eds.). Springer-Verlag Berlin Heidelberg, p. 167-178 12 p. (Lecture Notes in Computer Science).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
  2 Citations (Scopus)
• 2014

  Size-Change Abstraction and Max-Plus Automata

  Colcombet, T., Daviaud, L. & Zuleger, F., 2014, MFCS 2014: Mathematical Foundations of Computer Science 2014. Csuhaj-Varjú, E., Dietzfelbinger, M. & Ésik, Z. (eds.). Springer-Verlag Berlin Heidelberg, p. 208-219 12 p. (Lecture Notes in Computer Science).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
  19 Citations (Scopus)
• 2013

  Approximate comparison of distance automata

  Colcombet, T. & Daviaud, L., 2013, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013. p. 574-585 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 20).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access
  10 Citations (Scopus)