default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaure Daviaud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j5]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: 78-96 (2021)- 2020
- [j4]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) - [j3]Laure Daviaud:
Register complexity and determinisation of max-plus automata. ACM SIGLOG News 7(2): 4-14 (2020) - 2018
- [j2]Laure Daviaud, Charles Paperman:
Classes of languages generated by the Kleene star of a word. Inf. Comput. 262: 90-109 (2018) - 2016
- [j1]Thomas Colcombet, Laure Daviaud:
Approximate Comparison of Functions Computed by Distance Automata. Theory Comput. Syst. 58(4): 579-613 (2016)
Conference and Workshop Papers
- 2023
- [c20]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 - [c19]Laure Daviaud, David Purser:
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). LICS 2023: 1-13 - [c18]Laure Daviaud, Andrew Ryzhikov:
Universality and Forall-Exactness of Cost Register Automata with Few Registers. MFCS 2023: 40:1-40:15 - 2020
- [c17]Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini:
The Strahler Number of a Parity Game. ICALP 2020: 123:1-123:19 - [c16]Laure Daviaud:
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases. LATA 2020: 17-32 - 2019
- [c15]Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen:
Alternating Weak Automata from Universal Trees. CONCUR 2019: 18:1-18:14 - [c14]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. SODA 2019: 2333-2349 - 2018
- [c13]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 - [c12]Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna:
Regular and First-Order List Functions. LICS 2018: 125-134 - [c11]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic:
A pseudo-quasi-polynomial algorithm for mean-payoff parity games. LICS 2018: 325-334 - 2017
- [c10]Thomas Colcombet, Laure Daviaud, Florian Zuleger:
Automata and Program Analysis. FCT 2017: 3-10 - [c9]Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois:
Degree of Sequentiality of Weighted Automata. FoSSaCS 2017: 215-230 - [c8]Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle:
Which Classes of Origin Graphs Are Generated by Transducers. ICALP 2017: 114:1-114:13 - [c7]Laure Daviaud, Pierre Guillon, Glenn Merlet:
Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices. MFCS 2017: 19:1-19:14 - [c6]Laure Daviaud, Marianne Johnson:
The Shortest Identities for Max-Plus Automata with Two States. MFCS 2017: 48:1-48:13 - 2016
- [c5]Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot:
A Generalised Twinning Property for Minimisation of Cost Register Automata. LICS 2016: 857-866 - [c4]Laure Daviaud, Denis Kuperberg, Jean-Éric Pin:
Varieties of Cost Functions. STACS 2016: 30:1-30:14 - 2015
- [c3]Laure Daviaud, Charles Paperman:
Classes of Languages Generated by the Kleene Star of a Word. MFCS (1) 2015: 167-178 - 2014
- [c2]Thomas Colcombet, Laure Daviaud, Florian Zuleger:
Size-Change Abstraction and Max-Plus Automata. MFCS (1) 2014: 208-219 - 2013
- [c1]Thomas Colcombet, Laure Daviaud:
Approximate comparison of distance automata. STACS 2013: 574-585
Informal and Other Publications
- 2023
- [i11]Laure Daviaud, David Purser:
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). CoRR abs/2304.05229 (2023) - [i10]Laure Daviaud, Marianne Johnson:
Feasability of Learning Weighted Automata on a Semiring. CoRR abs/2309.07806 (2023) - 2020
- [i9]Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini:
The Strahler number of a parity game. CoRR abs/2003.08627 (2020) - 2019
- [i8]Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen:
Alternating Weak Automata from Universal Trees. CoRR abs/1903.12620 (2019) - 2018
- [i7]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic:
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. CoRR abs/1803.04756 (2018) - [i6]Mikolaj Bojanczyk, Laure Daviaud, S. Krishna:
Regular and First Order List Functions. CoRR abs/1803.06168 (2018) - [i5]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) - [i4]Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith:
Undecidability of MSO+"ultimately periodic". CoRR abs/1807.08506 (2018) - [i3]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. CoRR abs/1807.10546 (2018) - 2017
- [i2]Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois:
Degree of sequentiality of weighted automata. CoRR abs/1701.04632 (2017) - 2016
- [i1]Laure Daviaud, Pierre Guillon, Glenn Merlet:
Comparison of max-plus automata and joint spectral radius of tropical matrices. CoRR abs/1612.02647 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
