default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvie Davies
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[e1]Tanja Svarre, Sylvie Davies, Aida Slavic, Judi Vernau, Niké Brown:
Proceedings of the 7th ISKO UK Biennial Conference 2023, University of Strathclyde, Glasgow, Scotland, July 24-25, 2023. CEUR Workshop Proceedings 3661, CEUR-WS.org 2024 [contents]
2010 – 2019
- 2019
- [b1]Sylvie Davies:
Algebraic Approaches to State Complexity of Regular Operations. University of Waterloo, Ontario, Canada, 2019 - [j7]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-Returning Regular Languages. Int. J. Found. Comput. Sci. 30(6-7): 921-957 (2019) - [j6]Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan:
State complexity of pattern matching in regular languages. Theor. Comput. Sci. 777: 121-131 (2019) - [c7]Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan:
State Complexity of Single-Word Pattern Matching in Regular Languages. DCFS 2019: 86-97 - [c6]Sylvie Davies, Michal Hospodár
:
Square, Power, Positive Closure, and Complementation on Star-Free Languages. DCFS 2019: 98-110 - 2018
- [j5]Sylvie Davies:
Primitivity, Uniform Minimality, and State Complexity of Boolean Operations. Theory Comput. Syst. 62(8): 1952-2005 (2018) - [c5]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Deterministic Union-Free Regular Languages. DCFS 2018: 37-48 - [c4]Sylvie Davies:
A New Technique for Reachability of States in Concatenation Automata. DCFS 2018: 75-87 - [c3]Sylvie Davies:
A General Approach to State Complexity of Operations: Formalization and Limitations. DLT 2018: 256-268 - [c2]Sylvie Davies:
State Complexity of Reversals of Deterministic Finite Automata with Output. CIAA 2018: 133-145 - [i9]Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan:
State Complexity of Pattern Matching in Finite Automata. CoRR abs/1806.04645 (2018) - [i8]Sylvie Davies:
A General Approach to State Complexity of Operations: Formalization and Limitations. CoRR abs/1806.08476 (2018) - 2017
- [c1]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-returning Regular Languages. DCFS 2017: 89-101 - [i7]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-Returning Regular Languages. CoRR abs/1701.03944 (2017) - [i6]Sylvie Davies:
Primitivity, Uniform Minimality and State Complexity of Boolean Operations. CoRR abs/1702.00877 (2017) - [i5]Sylvie Davies:
State Complexity of Reversals of Deterministic Finite Automata with Output. CoRR abs/1705.07150 (2017) - [i4]Sylvie Davies:
A New Technique for Reachability of States in Concatenation Automata. CoRR abs/1710.05061 (2017) - [i3]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Deterministic Union-Free Regular Languages. CoRR abs/1711.09149 (2017) - 2016
- [j4]Janusz A. Brzozowski, Sylvie Davies, Bo Yang Victor Liu:
Most Complex Regular Ideal Languages. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - 2015
- [j3]Janusz A. Brzozowski, Sylvie Davies:
Quotient Complexities of Atoms in Regular Ideal Languages. Acta Cybern. 22(2): 293-311 (2015) - [i2]Janusz A. Brzozowski, Sylvie Davies:
Quotient Complexities of Atoms in Regular Ideal Languages. CoRR abs/1503.02208 (2015) - [i1]Janusz A. Brzozowski, Sylvie Davies, Bo Yang Victor Liu:
Most Complex Regular Ideals. CoRR abs/1511.00157 (2015)
2000 – 2009
- 2007
- [j2]Rita Marcella, Graeme Baxter, Sylvie Davies, Dick Toornstra:
The information needs and information-seeking behaviour of the users of the European Parliamentary Documentation Centre: A customer knowledge study. J. Documentation 63(6): 920-934 (2007) - 2001
- [j1]Kerstin Jorna, Sylvie Davies:
Multilingual thesauri for the modern world - no ideal solution? J. Documentation 57(2): 284-295 (2001)
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-04-24 22:49 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:
