Laure Daviaud

40 papers A* 8A 2B 6C 1Journal 18Unranked 5
YearRankTypeTitle / Venue / Authors
2025 — conf
Extracting Deterministic Finite Automata from RNNs via Hyperplane Partitioning and Learning.
IJCCI (3)
Sandamali Yashodhara Wickramasinghe, Jacob M. Howe, Laure Daviaud
2025 — conf
Extracting Weighted Finite Automata from RNNs via iterative partitioning and spectral learning.
OVERLAY
Sandamali Yashodhara Wickramasinghe, Jacob M. Howe, Laure Daviaud
2025 J jnl
Feasability of Learning Weighted Automata on a Semiring.
Log. Methods Comput. Sci.
Laure Daviaud, Marianne Johnson
2025 J jnl
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).
Log. Methods Comput. Sci.
Laure Daviaud, David Purser, Marie Tcheng
2023 J jnl
Feasability of Learning Weighted Automata on a Semiring.
CoRR
Laure Daviaud, Marianne Johnson
2023 — conf
Formal and Empirical Studies of Counting Behaviour in ReLU RNNs.
ICGI
Nadine El-Naggar, Andrew Ryzhikov, Laure Daviaud, Pranava Madhyastha, Tillman Weyde
2023 A* conf
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).
LICS
Laure Daviaud, David Purser
2023 J jnl
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).
CoRR
Laure Daviaud, David Purser
2023 B conf
Universality and Forall-Exactness of Cost Register Automata with Few Registers.
MFCS
Laure Daviaud, Andrew Ryzhikov
2021 J jnl
When are emptiness and containment decidable for probabilistic automata?
J. Comput. Syst. Sci.
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2020 C conf
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases.
LATA
Laure Daviaud
2020 J jnl
Register complexity and determinisation of max-plus automata.
ACM SIGLOG News
Laure Daviaud
2020 A* conf
The Strahler Number of a Parity Game.
ICALP
Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini
2020 J jnl
The Strahler number of a parity game.
CoRR
Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini
2020 J jnl
Undecidability of a weak version of MSO+U.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
2019 B conf
Alternating Weak Automata from Universal Trees.
CONCUR
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
2019 J jnl
Alternating Weak Automata from Universal Trees.
CoRR
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
2019 A* conf
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.
SODA
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2018 A* conf
A pseudo-quasi-polynomial algorithm for mean-payoff parity games.
LICS
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic
2018 J jnl
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games.
CoRR
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic
2018 J jnl
Classes of languages generated by the Kleene star of a word.
Inf. Comput.
Laure Daviaud, Charles Paperman
2018 J jnl
Regular and First Order List Functions.
CoRR
Mikolaj Bojanczyk, Laure Daviaud, S. Krishna
2018 A* conf
Regular and First-Order List Functions.
LICS
Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna
2018 J jnl
Undecidability of MSO+"ultimately periodic".
CoRR
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
2018 J jnl
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.
CoRR
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2018 J jnl
When is Containment Decidable for Probabilistic Automata?
CoRR
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2018 A* conf
When is Containment Decidable for Probabilistic Automata?.
ICALP
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2017 B conf
Automata and Program Analysis.
FCT
Thomas Colcombet, Laure Daviaud, Florian Zuleger
2017 B conf
Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices.
MFCS
Laure Daviaud, Pierre Guillon, Glenn Merlet
2017 B conf
Degree of Sequentiality of Weighted Automata.
FoSSaCS
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
2017 J jnl
Degree of sequentiality of weighted automata.
CoRR
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
2017 B conf
The Shortest Identities for Max-Plus Automata with Two States.
MFCS
Laure Daviaud, Marianne Johnson
2017 A* conf
Which Classes of Origin Graphs Are Generated by Transducers.
ICALP
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle
2016 A* conf
A Generalised Twinning Property for Minimisation of Cost Register Automata.
LICS
Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot
2016 J jnl
Approximate Comparison of Functions Computed by Distance Automata.
Theory Comput. Syst.
Thomas Colcombet, Laure Daviaud
2016 J jnl
Comparison of max-plus automata and joint spectral radius of tropical matrices.
CoRR
Laure Daviaud, Pierre Guillon, Glenn Merlet
2016 A conf
Varieties of Cost Functions.
STACS
Laure Daviaud, Denis Kuperberg, Jean-Éric Pin
2015 — conf
Classes of Languages Generated by the Kleene Star of a Word.
MFCS (1)
Laure Daviaud, Charles Paperman
2014 — conf
Size-Change Abstraction and Max-Plus Automata.
MFCS (1)
Thomas Colcombet, Laure Daviaud, Florian Zuleger
2013 A conf
Approximate comparison of distance automata.
STACS
Thomas Colcombet, Laure Daviaud