Jacques Duparc

According to our database1, Jacques Duparc authored at least 29 papers between 2001 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Wadge-Wagner hierarchies.
Proceedings of the Handbook of Automata Theory., 2021

2020
The Wadge order on the Scott Domain is not a Well-quasi-order.
J. Symb. Log., 2020

2018
Some remarks on Baire's grand theorem.
Arch. Math. Log., 2018

2016
Expressive Power of Nondeterministic Recurrent Neural Networks in Terms of their Attractor Dynamics.
Int. J. Unconv. Comput., 2016

2015
Easy Proofs of Löwenheim-Skolem Theorems by Means of Evaluation Games.
CoRR, 2015

Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics.
Proceedings of the Unconventional Computation and Natural Computation, 2015

A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2].
Proceedings of the Descriptional Complexity of Formal Systems, 2015

On Unambiguous Regular Tree Languages of Index (0, 2).
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
The wadge hierarchy of Petri Nets ω-languages.
Proceedings of the Logic, Computation, Hierarchies, 2014

2013
The Wadge Hierarchy of Petri Nets <i>ω</i>-Languages.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2011
Definable Operations On Weakly Recognizable Sets of Trees.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2009
A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy: Part II.
RAIRO Theor. Informatics Appl., 2009

A game theoretical approach to the algebraic counterpart of the Wagner hierarchy: Part I.
RAIRO Theor. Informatics Appl., 2009

The Wadge Hierarchy of Max-Regular Languages.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
An omega-power of a context-free language which is Borel above Delta^0_omega
CoRR, 2008

Describing the Wadge Hierarchy for the Alternation Free Fragment of µ-Calculus (I).
Proceedings of the Logic and Theory of Algorithms, 2008

The Algebraic Counterpart of the Wagner Hierarchy.
Proceedings of the Logic and Theory of Algorithms, 2008

On the topological complexity of tree languages.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007

On the Topological Complexity of Weakly Recognizable Tree Languages.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006
The Missing Link for omega-rational Sets, Automata, and Semigroups.
Int. J. Algebra Comput., 2006

2005
Transfinite Extension of the Mu-Calculus.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2003
A hierarchy of deterministic context-free omega-languages.
Theor. Comput. Sci., 2003

The Steel hierarchy of ordinal valued Borel mappings.
J. Symb. Log., 2003

Positive Games and Persistent Strategies.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Solving Pushdown Games with a Sigma<sub>3</sub> Winning Condition.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
Computer science and the fine structure of Borel sets.
Theor. Comput. Sci., 2001

Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank.
J. Symb. Log., 2001


  Loading...