default search action
Jacques Duparc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [p2]Jacques Duparc:
Wadge-Wagner hierarchies. Handbook of Automata Theory (I.) 2021: 695-728 - 2020
- [j10]Jacques Duparc, Louis Vuilleumier
:
The Wadge order on the Scott Domain is not a Well-quasi-order. J. Symb. Log. 85(1): 300-324 (2020)
2010 – 2019
- 2018
- [j9]Riccardo Camerlo
Some remarks on Baire's grand theorem. Arch. Math. Log. 57(3-4): 195-201 (2018) - 2016
- [j8]Jérémie Cabessa, Jacques Duparc:
Expressive Power of Nondeterministic Recurrent Neural Networks in Terms of their Attractor Dynamics. Int. J. Unconv. Comput. 12(1): 25-50 (2016) - 2015
- [c15]Jacques Duparc, Kevin Fournier, Szczepan Hummel:
On Unambiguous Regular Tree Languages of Index (0, 2). CSL 2015: 534-548 - [c14]Jacques Duparc, Kevin Fournier:
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]. DCFS 2015: 81-92 - [c13]Jérémie Cabessa
Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics. UCNC 2015: 144-156 - [i2]Jacques Duparc:
Easy Proofs of Löwenheim-Skolem Theorems by Means of Evaluation Games. CoRR abs/1507.03665 (2015) - 2014
- [p1]Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre:
The wadge hierarchy of Petri Nets ω-languages. Logic, Computation, Hierarchies 2014: 109-138 - 2013
- [c12]Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre:
The Wadge Hierarchy of Petri Nets ω-Languages. LFCS 2013: 179-193 - 2011
- [c11]Jacques Duparc, Alessandro Facchini
Definable Operations On Weakly Recognizable Sets of Trees. FSTTCS 2011: 363-374
2000 – 2009
- 2009
- [j7]Jérémie Cabessa
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy: Part I. RAIRO Theor. Informatics Appl. 43(3): 443-461 (2009) - [j6]Jérémie Cabessa
A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy: Part II. RAIRO Theor. Informatics Appl. 43(3): 463-515 (2009) - [c10]Jacques Duparc, Alessandro Facchini
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. CSL 2009: 225-239 - [c9]Jérémie Cabessa
The Wadge Hierarchy of Max-Regular Languages. FSTTCS 2009: 121-132 - 2008
- [c8]André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski:
On the topological complexity of tree languages. Logic and Automata 2008: 9-28 - [c7]Jérémie Cabessa
The Algebraic Counterpart of the Wagner Hierarchy. CiE 2008: 100-109 - [c6]Jacques Duparc, Alessandro Facchini
Describing the Wadge Hierarchy for the Alternation Free Fragment of µ-Calculus (I). CiE 2008: 186-195 - [i1]Jacques Duparc, Olivier Finkel:
An omega-power of a context-free language which is Borel above Delta^0_omega. CoRR abs/0801.1783 (2008) - 2007
- [c5]Jacques Duparc, Filip Murlak:
On the Topological Complexity of Weakly Recognizable Tree Languages. FCT 2007: 261-273 - [c4]Jacques Duparc, Alessandro Facchini
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata. ILC 2007: 46-55 - [e1]Jacques Duparc, Thomas A. Henzinger:
Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. Lecture Notes in Computer Science 4646, Springer 2007, ISBN 978-3-540-74914-1 [contents] - 2006
- [j5]Jacques Duparc, Mariane Riss:
The Missing Link for omega-rational Sets, Automata, and Semigroups. Int. J. Algebra Comput. 16(1): 161-186 (2006) - 2005
- [c3]Julian C. Bradfield, Jacques Duparc, Sandra Quickert:
Transfinite Extension of the Mu-Calculus. CSL 2005: 384-396 - 2003
- [j4]Jacques Duparc:
The Steel hierarchy of ordinal valued Borel mappings. J. Symb. Log. 68(1): 187-234 (2003) - [j3]Jacques Duparc:
A hierarchy of deterministic context-free omega-languages. Theor. Comput. Sci. 290(3): 1253-1300 (2003) - [c2]Jacques Duparc:
Positive Games and Persistent Strategies. CSL 2003: 183-196 - 2002
- [c1]Thierry Cachat, Jacques Duparc, Wolfgang Thomas:
Solving Pushdown Games with a Sigma3 Winning Condition. CSL 2002: 322-336 - 2001
- [j2]Jacques Duparc:
Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank. J. Symb. Log. 66(1): 56-86 (2001) - [j1]Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre:
Computer science and the fine structure of Borel sets. Theor. Comput. Sci. 257(1-2): 85-105 (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-25 05:43 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: