City Research Online

Wickramasinghe, S. Y., Howe, J. M. ORCID: 0000-0001-8013-6941 & Daviaud, L. (2025). Extracting Weighted Finite Automata from RNNs via iterative partitioning and spectral learning. Paper presented at the International Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis, 26 Oct 2025, Bologna, Italy.

Wickramasinghe, S. Y., Howe, J. ORCID: 0000-0001-8013-6941 & Daviaud, L. (2025). Extracting deterministic finite automata from RNNs via hyperplane partitioning and learning. Paper presented at the International Conference on Explainable AI for Neural and Symbolic Methods, 22-24 Oct 2025, Marbella, Spain.

El-Naggar, N., Ryzhikov, A., Daviaud, L. , Madhyastha, P. ORCID: 0000-0002-4438-8161 & Weyde, T. ORCID: 0000-0001-8028-9905view all authors (2023). Formal and Empirical Studies of Counting Behaviour in ReLU RNNs. In: Proceedings of Machine Learning Research. The 16th International Conference on Grammatical Inference, 10-13 Jul 2023

Daviaud, L. ORCID: 0000-0002-9220-7118 & Purser, D. (2023). The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). In: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS 2023, 26-29 June 2023, Boston, USA. doi: 10.1109/LICS56636.2023.10175798

Daviaud, L. ORCID: 0000-0002-9220-7118, Jurdzinski, M., Lazic, R. , Mazowiecki, F., Perez, G. A. & Worrell, J.view all authors (2021). When are Emptiness and Containment Decidable for Probabilistic Automata?. Journal of Computer and System Sciences, 119, pp. 78-96. doi: 10.1016/j.jcss.2021.01.006

Daviaud, L. ORCID: 0000-0002-9220-7118, Jurdziński, M. & Thejaswini, K. S. (2020). The Strahler number of a parity game. LIPIcs : Leibniz International Proceedings in Informatics, 168, article number 123. doi: 10.4230/LIPIcs.ICALP.2020.123

Daviaud, L. ORCID: 0000-0002-9220-7118 (2020). Register complexity and determinisation of max-plus automata. ACM SIGLOG News, 7(2), pp. 4-14. doi: 10.1145/3397619.3397621

Daviaud, L. ORCID: 0000-0002-9220-7118 (2020). Containment and equivalence of weighted automata: Probabilistic and max-plus cases. In: Language and Automata Theory and Applications. LATA 2020. doi: 10.1007/978-3-030-40608-0_2

Bojanczyk, M., Daviaud, L. ORCID: 0000-0002-9220-7118, Guillon, B. , Penelle, V. & Sreejith, A. V.view all authors (2020). Undecidability of a weak version of MSO+U. Logical Methods in Computer Science, 16(1), 12:1-12:15. doi: 10.23638/LMCS-16(1:12)2020

Czerwiński, W., Daviaud, L., Fijalkow, N. , Jurdziński, M., Lazić, R. & Parys, P.view all authors (2019). Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM - SIAM Symposium on Discrete Algorithms, 6 - 9 January 2019, San Diego, California, USA.

Daviaud, L. ORCID: 0000-0002-9220-7118, Jurdziński, M. & Lehtinen, K. (2019). Alternating Weak Automata from Universal Trees. Paper presented at the 30th International Conference on Concurrency Theory, 26-31 Aug 2019, Amsterdam, the Netherlands. doi: 10.4230/LIPIcs.CONCUR.2019.14

Daviaud, L. & Paperman, C. (2018). Classes of languages generated by the Kleene star of a word. Information and Computation, 262, pp. 90-109. doi: 10.1016/j.ic.2018.07.002

Bojanczyk, M., Daviaud, L. & Narayanan, K. S. (2018). Regular and First Order List Functions. In: LICS '18 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. doi: 10.1145/3209108.3209163

Daviaud, L. ORCID: 0000-0002-9220-7118, Jurdziński, M. & Lazić, R. (2018). A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. In: LICS '18 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science.

Daviaud, L., Jurdziński, M., Lazić, R. , Mazowiecki, F., Pérez, G. A. & Worrell, J.view all authors (2018). When is Containment Decidable for Probabilistic Automata? In: 45th International Colloquium on Automata, Languages, and Programming. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 9-13 July, Prague, Czech Republic.

Daviaud, L., Johnson, M. & Kambites, M. (2018). Identities in upper triangular tropical matrix semigroups and the bicyclic monoid. Journal of Algebra, 501, pp. 503-525. doi: 10.1016/j.jalgebra.2017.12.032

Daviaud, L., Guillon, P. & Merlet, G. (2017). Comparison of max-plus automata and joint spectral radius of tropical matrices. In: Larsen, K. G., Bodlaender, H. L. & Raskin, J-F. (Eds.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 21 -25 August 2017, Aalborg, Denmark.

Daviaud, L. & Johnson, M. (2017). The Shortest Identities for Max-Plus Automata with Two States. In: Larsen, Kim G, Bodlaender, Hans L & Raskin, Jean-François (Eds.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 21 -25 August 2017, Aalborg, Denmark.

Bojanczyk, M., Daviaud, L., Guillon, B. & Penelle, V.view all authors (2017). Which Classes of Origin Graphs Are Generated by Transducers. In: Chatzigiannakis, I., Indyk, P., Kuhn, F. & Muscholl, A.view all authors (Eds.), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), 10 - 14 July 2017, Warsaw, Poland.

Daviaud, L., Jecker, I., Reynier, P-A. & Villevalois, D.view all authors (2017). Degree of Sequentiality of Weighted Automata. In: Foundations of Software Science and Computation Structures. FoSSaCS 2017. Foundations of Software Science and Computation Structures. FoSSaCS 2017, 24-27 April, Uppsala, Sweden. doi: 10.1007/978-3-662-54458-7_13

Daviaud, L., Reynier, P-A. & Talbot, J-M. (2016). A Generalised Twinning Property for Minimisation of Cost Register Automata. In: LICS '16 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 05 -08 July 2016, New York City, USA. doi: 10.1145/2933575.2934549

Colcombet, T. & Daviaud, L. (2016). Approximate Comparison of Functions Computed by Distance Automata. Theory of Computing Systems, 58(4), pp. 579-613. doi: 10.1007/s00224-015-9643-3

Daviaud, L., Kuperberg, D. & Pin, J-E. (2016). Varieties of Cost Functions. In: Ollinger, Nicolas & Vollmer, Heribert (Eds.), 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016).

Daviaud, L. & Paperman, C. (2015). Classes of Languages Generated by the Kleene Star of a Word. In: Italiano, G., Pughizzini, G. & Sannella, D. (Eds.), Mathematical Foundations of Computer Science 2015. MFCS 2015. 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), 24 - 28 Aug 2015, Milan, Italy. doi: 10.1007/978-3-662-48057-1_13

Colcombet, T., Daviaud, L. & Zuleger, F. (2014). Size-Change Abstraction and Max-Plus Automata. In: Csuhaj-Varju, E., Dietzfelbinger, M. & Esik, Z. (Eds.), Mathematical Foundations of Computer Science 2014. MFCS 2014.

Colcombet, T. & Daviaud, L. (2013). Approximate comparison of distance automata. In: Portier, N. & Wilke, T. (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013).