Jacques Duparc

Publications | Mémoires et thèses

La recherche avancée est accessible via Serval

Les publications peuvent être gérées en accédant à Serval via MyUnil


42 publications

 
A Coarsification of the Wagner Hierarchy
Duparc J., submitted to Theoretical Computer Science.
 
A Normal Form for Borel Sets
Duparc J., extended abstract, not submitted.
 
Anti-Chains of Mappings from omega^omega on some BQO
Duparc J., temporary version, to be submitted.
 
Wadge Degrees of Louveau's (Wadge) Classes
Duparc J., related to the extended abstract "A Normal Form for Borel Sets" (temporary version).
 
Wadge Hierarchy and Veblen Hierarchy. Part II: Borel Sets of Infinite Rank
Duparc J., submitted to the Journal of Symbolic Logic.
 
Some remarks on Baire's grand theorem
Camerlo R., Duparc J., 2017/06/01. Archive for Mathematical Logic pp. 1-7. Peer-reviewed.
 
Jeux, Topologie et Automates
Duparc J., 2017. pp. 55-79 dans Salvy B. (eds.) Informatique Mathématique: Une photographie en 2017 chap. 3, CNRS Editions.
 
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]
Duparc J., Fournier K., 2015. pp. 81-92 dans Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015, Lecture Notes in Computer Science. Peer-reviewed, Springer, Cham.
 
Easy Proofs of Löwenheim-Skolem Theorems by Means of Evaluation Games
Duparc J., 2015. pp. 27-34 dans Huertas M.A., Marcos J., Manzano M., Pinchinat S., Schwarzentruber F. (eds.) Proceedings of the Fourth International Conference on Tools for Teaching Logic, LIPIcs–Leibniz International Proceedings in Informatics, Schloss Dagstuhl.
 
Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics
Cabessa J., Duparc J., 2015. pp. 144-156 dans Unconventional Computation and Natural Computation: 14th International Conference, Lecture Notes in Computer Science. Peer-reviewed, Springer, Cham.
 
Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics
Cabessa J., Duparc J., 2015. Unconventional Computation and Natural Computation, 12 (1) pp. 144-156. Peer-reviewed.
 
La Logique Pas à Pas
Duparc J., 2015. 570, Presses polytechniques et universitaires romandes.
 
The Wadge Hierarchy of Petri Nets omega-Languages
Duparc J., Finkel O., Ressayre J-P., 2014. pp. 109-138 dans Brattka V., Diener H., Spreen D. (eds.) Logic, Computation, Hierarchies, De Gruyter.
 
The Wadge Hierarchy of Petri Nets \emph\(\omega\)-Languages
Duparc J., Finkel O., Ressayre J.-P., 2013. pp. 179-193 dans Logical Foundations of Computer Science, International Symposium, LFCS 2013, January 6-8, 2013. Proceedings, Lecture Notes in Computer Science.
 
Definable Operations On Weakly Recognizable Sets of Trees
Duparc J., Facchini A., Murlak F., 2011. pp. 363-374 dans IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, Leibniz International Proceedings in Informatics.
The Wadge Hierarchy of Max-Regular Languages
Cabessa J., Duparc J., Facchini A., Murlak F., 2009/12. pp. 121-132 dans Kannan R., Narayan Kumar K. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), Leibniz International Proceedings in Informatics (LIPIcs). Peer-reviewed, Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
 
A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy: Part II
Cabessa J., Duparc J., 2009/07. RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications, 43 (3) pp. 463-515. Peer-reviewed.
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
Duparc J., Facchini A., 2009. pp. 46-55 dans Archibald M., Brattka V., Goranko V., Löwe B. (eds.) Selected Papers of the International Conference Infinity in Logic and Computation, Cape Town, South Africa, November 2007, Lecture Notes in Computer Science. Peer-reviewed, Springer.
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Duparc J., Facchini A., Murlak F., 2009. pp. 225-239 dans Grädel E., Kahle R. (eds.) Computer Science Logic: 23rd International Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009, Proceedings, Lecture Notes in Computer Science. Peer-reviewed, Springer.
 
The Topological Complexity of Models of the Modal μ-Calculus: On The Alternation Free Fragment and Beyond
Duparc J., Facchini A., 2009. hal-00396433, version 1, Laboratoire Bordelais de Recherche en Informatique et Université de Lausanne.
 
The Algebraic Counterpart of the Wagner Hierarchy
Cabessa J., Duparc J., 2008/06. Lecture Notes in Computer Science, 5028 pp. 100-109. Peer-reviewed.
 
A Normal Form of Borel Sets of Finite Rank
Duparc J., 2008., submitted to Notre-Dame Journal of Formal Logic radically different proofs and tools than the ones in the article submitted to JSL. These proofs are close to the ones in my Ph.D. Thesis, but extremely reduced.
 
Describing the Wadge Hierarchy for the Alternation Free Fragment of μ -Calculus (I) The Levels Below ω 1
Duparc J., Facchini A., 2008. pp. 186-195 dans Beckmann A., Dimitracopoulos C., Löwe B. (eds.) Logic and Theory of Algorithms : Fourth Conference on Computability in Europe, CiE 2008, Athens, Greece, June 2008, Proceedings, Lecture Notes in Computer Science. Peer-reviewed, Springer.
 
On the topological complexity of tree languages
Arnold A., Duparc J., Murlak F., Niwiński D., 2007/12. pp. 9-28 dans Flum J., Grädel E., Wilke T. (eds.) Logic and Automata: History and Perspectives, Amsterdam University Press.
 
Computer Science Logic
Duparc J., Henzinger T.A., 2007/09. dans 21st International Workshop, CSL 2007 16th Annual Conference of the EACSL Lausanne, Switzerland. Peer-reviewed, Springer.
 
An infinite game on omega-semigroups
Cabessa J., Duparc J., 2007., Foundations of the Formal Sciences V. Infinite Games pp. 63-78 dans Bold S., Löwe B., Räsch T. , van Benthem J. (eds.) Infinite Games, Papers of the conference Foundations of the Formal Sciences V, held in Bonn, November 26-29, 2004, Studies in Logic. Peer-reviewed, College Publications, London.
 
An ω-power of a finite context-free language which is Borel above ∆0ω
Duparc J., Finkel O., 2007., Foundations of the Formal Sciences V. Infinite Games pp. 109-122 dans Bold S. , Löwe B., Räsch T. , van Benthem J. (eds.) Infinite Games, Papers of the conference Foundations of the Formal Sciences V, held in Bonn, November 26-29, 2004, Studies in Logic. Peer-reviewed, College Publications, London.
 
On the Topological Complexity of Weakly Recognizable Tree Languages
Duparc J., Murlak F., 2007. pp. 261-273 dans Fundamentals of Computation Theory : 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007. Proceedings, Lecture Notes on Computer Science. Peer-reviewed, Springer.
 
Wadge games and sets of reals recognized by simple machines: An omega power of a finite context-free language which is Borel above Delta^ø_omega.
Duparc J., Finkel O., 2007. Studies in Logic, 11 pp. 109-122. Peer-reviewed.
 
The Missing Link for omega-Rational Sets, Automata, and Semigroups
Duparc J., Riss M., 2006. International Journal of Algebra and Computation, 16 (1) pp. 161-185. Peer-reviewed.
 
Transfinite extension ot the mu-calculus
Bradfield J., Duparc J., Quickert S., 2005. pp. 384-396 dans Ong L. (eds.) Computer Science Logic : 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005. Proceedings, Lecture Notes in Computer Science. Peer-reviewed, Springer Berlin / Heidelberg.
 
Games on Semigroups
Duparc J., Cabessa J., 2004/09..
 
A Hierarchy of Deterministic Context-Free omega-languages
Duparc J., 2003. Theoretical Computer Science, 290 (3) pp. 1253-1300. Peer-reviewed.
 
Positive Games and persistent Strategies
Duparc J., 2003. pp. 183-196 dans 12th Annual Conference of the European Association for Computer Science Logic, Lecture Notes in Computer Science. Peer-reviewed, Springer.
 
The Steel Hierarchy of Ordinal Valued Borel Mappings
Duparc J., 2003. Journal of Symbolic Logic, 68 (1) pp. 187-234. Peer-reviewed.
 
Solving Pushdown Games with a ∑3 Winning Condition
Cachat T., Duparc J., Thomas W., 2002. pp. 322-336 dans Bradfield J. (eds.) Computer Science Logic : 11th Annual Conference of the EACSL Edinburgh, Scotland, UK, September 22–25, 2002 Proceedings, Lecture Notes in Computer Science. Peer-reviewed, Springer.
 
Computer Science and the Fine Structure of Borel Sets
Duparc J., Finkel O., Ressayre J-P., 2001/04. Theoretical Computer Science, 257 (1-2) pp. 85-105. Peer-reviewed.
 
Wadge Hierarchy and Veblen Hierarchy. Part I: Borel Sets of Finite Rank
Duparc J., 2001. Journal of Symbolic Logic, 66 (1) pp. 56-86. Peer-reviewed.
 
Infinite Games, Finite Machines
Duparc J., Finkel O., Ressayre J-P., 2000. dans Proceedings of the Joint Conference of the 5th Barcelona Logic Meeting and the 6th Kurt Gödel colloquium, Collegium Logicum, Annals of the Kurt-Gödel-Society Vol 4, 2000.. Peer-reviewed.
 
The Normal Form of Borel Sets. Part II: Borel Sets of Infinite Rank
Duparc J., 1999. Comptes Rendus de l'Académie des Sciences - Series I - Mathematics, 328 (9) pp. 735-740. Peer-reviewed.
 
The Normal Form of Borel Sets. Part I: Borel Sets of Finite Rank
Duparc J., 1995. Comptes Rendus de l'Académie des Sciences - Series I - Mathematics,, 320 (6) pp. 651-656. Peer-reviewed.
 
The Normal Form of Borel Sets of Finite Rank
Duparc J., 1994. dans Contributed Papers of the Logic Colloquium'94. Peer-reviewed.
Partagez:
Unicentre - CH-1015 Lausanne
Suisse
Tél. +41 21 692 11 11
Fax. +41 21 692 26 15
Swiss University