Clik here to view.
Approximate comparison of distance automata.
Thomas Colcombet, Laure Daviaud: Approximate comparison of distance automata. STACS 2013: 574-585
View ArticleClik here to view.
Size-Change Abstraction and Max-Plus Automata.
Thomas Colcombet, Laure Daviaud, Florian Zuleger: Size-Change Abstraction and Max-Plus Automata. MFCS (1) 2014: 208-219
View ArticleClik here to view.
Classes of Languages Generated by the Kleene Star of a Word.
Laure Daviaud, Charles Paperman: Classes of Languages Generated by the Kleene Star of a Word. MFCS (1) 2015: 167-178
View ArticleClik here to view.
Comparison of max-plus automata and joint spectral radius of tropical matrices.
Laure Daviaud, Pierre Guillon, Glenn Merlet: Comparison of max-plus automata and joint spectral radius of tropical matrices. CoRR abs/1612.02647 (2016)
View ArticleClik here to view.
Varieties of Cost Functions.
Laure Daviaud, Denis Kuperberg, Jean-Éric Pin: Varieties of Cost Functions. STACS 2016: 30:1-30:14
View ArticleClik here to view.
A Generalised Twinning Property for Minimisation of Cost Register Automata.
Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot: A Generalised Twinning Property for Minimisation of Cost Register Automata. LICS 2016: 857-866
View ArticleClik here to view.
Approximate Comparison of Functions Computed by Distance Automata.
Thomas Colcombet, Laure Daviaud: Approximate Comparison of Functions Computed by Distance Automata. Theory Comput. Syst. 58(4): 579-613 (2016)
View ArticleClik here to view.
Degree of sequentiality of weighted automata.
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois: Degree of sequentiality of weighted automata. CoRR abs/1701.04632 (2017)
View ArticleClik here to view.
The Shortest Identities for Max-Plus Automata with Two States.
Laure Daviaud, Marianne Johnson: The Shortest Identities for Max-Plus Automata with Two States. MFCS 2017: 48:1-48:13
View ArticleClik here to view.
Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices.
Laure Daviaud, Pierre Guillon, Glenn Merlet: Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices. MFCS 2017: 19:1-19:14
View ArticleClik here to view.
Which Classes of Origin Graphs Are Generated by Transducers.
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle: Which Classes of Origin Graphs Are Generated by Transducers. ICALP 2017: 114:1-114:13
View ArticleClik here to view.
Degree of Sequentiality of Weighted Automata.
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois: Degree of Sequentiality of Weighted Automata. FoSSaCS 2017: 215-230
View ArticleClik here to view.
Automata and Program Analysis.
Thomas Colcombet, Laure Daviaud, Florian Zuleger: Automata and Program Analysis. FCT 2017: 3-10
View ArticleClik here to view.
Universal trees grow inside separating automata: Quasi-polynomial lower...
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys: Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games....
View ArticleClik here to view.
Undecidability of MSO+"ultimately periodic".
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith: Undecidability of MSO+"ultimately periodic". CoRR abs/1807.08506 (2018)
View ArticleClik here to view.
When is Containment Decidable for Probabilistic Automata?
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell: When is Containment Decidable for Probabilistic Automata? CoRR abs/1804.09077 (2018)
View ArticleClik here to view.
Regular and First Order List Functions.
Mikolaj Bojanczyk, Laure Daviaud, S. Krishna: Regular and First Order List Functions. CoRR abs/1803.06168 (2018)
View ArticleClik here to view.
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games.
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic: A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. CoRR abs/1803.04756 (2018)
View ArticleClik here to view.
A pseudo-quasi-polynomial algorithm for mean-payoff parity games.
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic: A pseudo-quasi-polynomial algorithm for mean-payoff parity games. LICS 2018: 325-334
View ArticleClik here to view.
Regular and First-Order List Functions.
Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna: Regular and First-Order List Functions. LICS 2018: 125-134
View ArticleClik here to view.
When is Containment Decidable for Probabilistic Automata?.
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell: When is Containment Decidable for Probabilistic Automata?. ICALP 2018: 121:1-121:14
View ArticleClik here to view.
Classes of languages generated by the Kleene star of a word.
Laure Daviaud, Charles Paperman: Classes of languages generated by the Kleene star of a word. Inf. Comput. 262: 90-109 (2018)
View ArticleClik here to view.
Alternating Weak Automata from Universal Trees.
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen: Alternating Weak Automata from Universal Trees. CoRR abs/1903.12620 (2019)
View ArticleClik here to view.
Universal trees grow inside separating automata: Quasi-polynomial lower...
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys: Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games....
View ArticleClik here to view.
Alternating Weak Automata from Universal Trees.
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen: Alternating Weak Automata from Universal Trees. CONCUR 2019: 18:1-18:14
View ArticleClik here to view.
The Strahler number of a parity game.
Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini: The Strahler number of a parity game. CoRR abs/2003.08627 (2020)
View ArticleClik here to view.
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus...
Laure Daviaud: Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases. LATA 2020: 17-32
View ArticleClik here to view.
The Strahler Number of a Parity Game.
Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini: The Strahler Number of a Parity Game. ICALP 2020: 123:1-123:19
View ArticleClik here to view.
Register complexity and determinisation of max-plus automata.
Laure Daviaud: Register complexity and determinisation of max-plus automata. ACM SIGLOG News 7(2): 4-14 (2020)
View ArticleClik here to view.
Undecidability of a weak version of MSO+U.
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith: Undecidability of a weak version of MSO+U. Log. Methods Comput. Sci. 16(1) (2020)
View ArticleClik here to view.
When are emptiness and containment decidable for probabilistic automata?
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell: When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. 119:...
View ArticleClik here to view.
Feasability of Learning Weighted Automata on a Semiring.
Laure Daviaud, Marianne Johnson: Feasability of Learning Weighted Automata on a Semiring. CoRR abs/2309.07806 (2023)
View ArticleClik here to view.
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).
Laure Daviaud, David Purser: The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). CoRR abs/2304.05229 (2023)
View ArticleClik here to view.
Universality and Forall-Exactness of Cost Register Automata with Few Registers.
Laure Daviaud, Andrew Ryzhikov: Universality and Forall-Exactness of Cost Register Automata with Few Registers. MFCS 2023: 40:1-40:15
View ArticleClik here to view.
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).
Laure Daviaud, David Purser: The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). LICS 2023: 1-13
View ArticleClik here to view.
Formal and Empirical Studies of Counting Behaviour in ReLU RNNs.
Nadine El-Naggar, Andrew Ryzhikov, Laure Daviaud, Pranava Madhyastha, Tillman Weyde: Formal and Empirical Studies of Counting Behaviour in ReLU RNNs. ICGI 2023: 199-222
View Article
