Folgen
Laure Daviaud
Laure Daviaud
City, University of London
Bestätigte E-Mail-Adresse bei city.ac.uk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys
SODA 2019 (30th annual Symposium on Discrete Algorithms), 2019
502019
A generalised twinning property for minimisation of cost register automata
L Daviaud, PA Reynier, JM Talbot
LICS 2016 (Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in …, 2016
312016
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
L Daviaud, M Jurdzinski, R Lazic
LICS 2018 (Logic in Computer Science, 33rd ACM/IEEE Symposium), 2018
29*2018
Size-change abstraction and max-plus automata
T Colcombet, L Daviaud, F Zuleger
MFCS 2014 (International Symposium on Mathematical Foundations of Computer …, 2014
292014
Regular and First Order List Functions
M Bojanczyk, L Daviaud, KS Narayanan
LICS 2018 (Logic in Computer Science, 33rd ACM/IEEE Symposium), 2018
282018
Identities in Upper Triangular Tropical Matrix Semigroups and the Bicyclic Monoid
L Daviaud, M Johnson, M Kambites
Journal of Algebra 501, 503-525, 2018
282018
Which Classes of Origin Graphs Are Generated by Transducers?
M Bojanczyk, L Daviaud, B Guillon, V Penelle
ICALP 2017 (44th International Colloquium on Automata, Languages, and …, 2017
282017
Approximate comparison of functions computed by distance automata
T Colcombet, L Daviaud
Theory of Computing Systems 58 (4), 579-613, 2016
22*2016
Degree of sequentiality of weighted automata
L Daviaud, I Jecker, PA Reynier, D Villevalois
FOSSACS 2017 (International Conference on Foundations of Software Science …, 2017
192017
The Strahler number of a parity game
L Daviaud, M Jurdziński, KS Thejaswini
ICALP 2020 (47th International Colloquium on Automata, Languages, and …, 2020
142020
When is Containment Decidable for Probabilistic Automata?
L Daviaud, M Jurdzinski, R Lazic, F Mazowiecki, GA Perez, J Worrell
ICALP 2018 (45th International Colloquium on Automata, Languages, and …, 2018
142018
Alternating weak automata from universal trees
L Daviaud, M Jurdzinski, K Lehtinen
CONCUR 2019 (30th International Conference on Concurrency Theory), 18:1-18:14, 2019
132019
Comparison of max-plus automata and joint spectral radius of tropical matrices
L Daviaud, P Guillon, G Merlet
MFCS 2017 (Mathematical Foundations of Computer Science 2017 - 42nd …, 2017
132017
Varieties of cost functions
L Daviaud, D Kuperberg, JÉ Pin
STACS 2016 (33th International Symposium on Theoretical Aspects of Computer …, 2016
92016
The Shortest Identities for Max-Plus Automata with Two States
L Daviaud, M Johnson
MFCS 2017 (Mathematical Foundations of Computer Science 2017 - 42nd …, 2017
82017
When are emptiness and containment decidable for probabilistic automata?
L Daviaud, M Jurdziński, R Lazić, F Mazowiecki, GA Pérez, J Worrell
Journal of Computer and System Sciences 119, 78-96, 2021
42021
Undecidability of a weak version of MSO+ U
AV Sreejith, V Penelle, B Guillon, L Daviaud, M Bojańczyk
Logical Methods in Computer Science 16, 2020
4*2020
Automata and program analysis
T Colcombet, L Daviaud, F Zuleger
FCT (International Symposium on Fundamentals of Computation Theory), 3-10, 2017
42017
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases
L Daviaud
International Conference on Language and Automata Theory and Applications, 17-32, 2020
22020
Classes of languages generated by the Kleene star of a word
L Daviaud, C Paperman
International Symposium on Mathematical Foundations of Computer Science, 167-178, 2015
22015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20