( en | de | ru )

 

Disambiguation of "Daviaud, Laure"

Author of the publication

copydeleteadd this publication to your clipboard
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).

, and . LICS, page 1-13. IEEE, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stefan Laure

Laure Aeschimann

Laure Amate

Laure Fourchaud

Laure Johann

 

Other publications of authors with the same name

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games., , , , , and . SODA, page 2333-2349. SIAM, (2019)Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases.. LATA, volume 12038 of Lecture Notes in Computer Science, page 17-32. Springer, (2020)Classes of Languages Generated by the Kleene Star of a Word., and . MFCS (1), volume 9234 of Lecture Notes in Computer Science, page 167-178. Springer, (2015)A Generalised Twinning Property for Minimisation of Cost Register Automata., , and . LICS, page 857-866. ACM, (2016)The Shortest Identities for Max-Plus Automata with Two States., and . MFCS, volume 83 of LIPIcs, page 48:1-48:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A pseudo-quasi-polynomial algorithm for mean-payoff parity games., , and . LICS, page 325-334. ACM, (2018)Universality and Forall-Exactness of Cost Register Automata with Few Registers., and . MFCS, volume 272 of LIPIcs, page 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Strahler Number of a Parity Game., , and . ICALP, volume 168 of LIPIcs, page 123:1-123:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Alternating Weak Automata from Universal Trees., , and . CONCUR, volume 140 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)When are emptiness and containment decidable for probabilistic automata?, , , , , and . J. Comput. Syst. Sci., (2021)