default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominique Lecomte
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Olivier Finkel, Dominique Lecomte:
Wadge degrees of Δ02 omega-powers. CoRR abs/2407.10520 (2024)- 2021
- [j12]Olivier Finkel, Dominique Lecomte
:
Some complete ømega-powers of a one-counter language, for any Borel class of finite rank. Arch. Math. Log. 60(1-2): 161-187 (2021) - 2020
- [i9]Olivier Finkel, Dominique Lecomte:
Some complete ω-powers of a one-counter language, for any Borel class of finite rank. CoRR abs/2006.08174 (2020) - [i8]Olivier Finkel, Dominique Lecomte:
Descriptive Set Theory and ω-Powers of Finitary Languages. CoRR abs/2007.08636 (2020)
2010 – 2019
- 2019
- [j11]Dominique Lecomte:
Acyclicity and reduction. Ann. Pure Appl. Log. 170(3): 383-426 (2019) - [j10]Dominique Lecomte:
A separation Result for Countable Unions of Borel Rectangles. J. Symb. Log. 84(2): 517-532 (2019) - [j9]Olivier Finkel, Olivier Carton, Dominique Lecomte:
Polishness of some topologies related to word or tree automata. Log. Methods Comput. Sci. 15(2) (2019) - [j8]Dominique Lecomte, Rafael Zamora:
Injective tests of low complexity in the plane. Math. Log. Q. 65(2): 134-169 (2019) - 2018
- [j7]Dominique Lecomte, Miroslav Zelený:
Universal and complete sets in martingale theory. Math. Log. Q. 64(4-5): 312-335 (2018) - 2017
- [c2]Olivier Carton, Olivier Finkel, Dominique Lecomte:
Polishness of Some Topologies Related to Automata. CSL 2017: 22:1-22:16 - [i7]Olivier Finkel, Olivier Carton, Dominique Lecomte:
Polishness of some topologies related to automata (Extended version). CoRR abs/1710.04002 (2017) - 2015
- [j6]Olivier Finkel, Dominique Lecomte, Pierre Simonnet:
An upper bound on the complexity of recognizable tree languages. RAIRO Theor. Informatics Appl. 49(2): 121-137 (2015) - [i6]Olivier Finkel, Dominique Lecomte, Pierre Simonnet:
An Upper Bound on the Complexity of Recognizable Tree Languages. CoRR abs/1503.02840 (2015)
2000 – 2009
- 2009
- [j5]Olivier Finkel, Dominique Lecomte:
Classical and effective descriptive complexities of omega-powers. Ann. Pure Appl. Log. 160(2): 163-191 (2009) - [j4]Olivier Finkel, Dominique Lecomte:
Decision problems for Turing machines. Inf. Process. Lett. 109(23-24): 1223-1226 (2009) - [j3]Dominique Lecomte:
How can we Recognize Potentially Subsets of the plane? J. Math. Log. 9(1) (2009) - [i5]Olivier Finkel, Dominique Lecomte:
Decision Problems For Turing Machines. CoRR abs/0909.0736 (2009) - 2008
- [j2]Dominique Lecomte, Benjamin D. Miller:
Basis theorems for non-Potentially closed Sets and graphs of uncountable Borel chromatic number. J. Math. Log. 8(2) (2008) - [i4]Olivier Finkel, Dominique Lecomte:
Topological Complexity of omega-Powers: Extended Abstract. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - [i3]Olivier Finkel, Dominique Lecomte:
Topological Complexity of omega-Powers : Extended Abstract. CoRR abs/0809.1812 (2008) - 2007
- [c1]Olivier Finkel, Dominique Lecomte:
There Exist Some omega -Powers of Any Borel Rank. CSL 2007: 115-129 - [i2]Dominique Lecomte, Olivier Finkel:
There Exist some Omega-Powers of Any Borel Rank. CoRR abs/0706.3523 (2007) - [i1]Olivier Finkel, Dominique Lecomte:
Classical and Effective Descriptive Complexities of omega-Powers. CoRR abs/0708.4176 (2007) - 2005
- [j1]Dominique Lecomte:
ω-powers and descriptive set theory. J. Symb. Log. 70(4): 1210-1232 (2005)
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 2025-01-09 01:08 CET 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:
