Max Dauchet

Olivier Perriquet, Hélène Touzet, Max Dauchet: Finding the common structure shared by two homologous RNAs. Bioinformatics 19(1): 108-116 (2003)

Max Dauchet, Sophie Tison, Marc Tommasi: Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. Theor. Comput. Sci. 281(1-2): 219-233 (2002)

Max Dauchet: Trees in Algebra and Programming (Editorial). Theor. Comput. Sci. 236(1-2): 1 (2000)

Arnaud Delhay, Max Dauchet, Patrick Taillibert, Philippe Vanheeghe: Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval. IJCAI 1999: 212-221

Olivier Delgrange, Max Dauchet, Eric Rivals: Location of Repetitive Regions in Sequences By Optimizing A Compression Method. Pacific Symposium on Biocomputing 1999: 254-265

Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin: Deterministic Rational Transducers and Random Sequences. FoSSaCS 1998: 258-272

Eric Rivals, Olivier Delgrange, Jean-Paul Delahaye, Max Dauchet, Marie-Odile Delorme, Alain Hénaut, Emmanuelle Ollivier: Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. Computer Applications in the Biosciences 13(2): 131-136 (1997)

Sylvain Porrot, Max Dauchet, Denis Pomorski: The Fractal Dimension of a Computable Figure is the Average Normalized Complexity of its Points. Bulletin of the EATCS 62 (1997)

Michel Bidoit, Max Dauchet (Eds.): TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings. Lecture Notes in Computer Science 1214, Springer 1997, isbn 3-540-62781-2

Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange: A Guaranteed Compression Scheme for Repetitive DNA Sequences. Data Compression Conference 1996: 453

Francis Bossut, Max Dauchet, Bruno Warin: A Kleene Theorem for a Class of Planar Acyclic Graphs. Inf. Comput. 117(2): 251-265 (1995)

Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé: Automata for Reduction Properties Solving. J. Symb. Comput. 20(2): 215-233 (1995)

Yves Andre, Max Dauchet: Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers. ITA 28(5): 447-463 (1994)

Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi: Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. Theor. Comput. Sci. 127(1): 69-98 (1994)

Max Dauchet: Symbolic Constraints and Tree Automata. CCL 1994: 217-218

Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard: Pumping, Cleaning and Symbolic Constraints Solving. ICALP 1994: 436-449

Philippe Devienne, Patrick Lebègue, Max Dauchet: Weighted Systems of Equations. Theor. Comput. Sci. 119(1): 39-62 (1993)

Max Dauchet: Rewriting and Tree Automata. Term Rewriting 1993: 95-113

Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet: Encompassment Properties and Automata with Constraints. RTA 1993: 328-342

Max Dauchet: Simulation of Turing Machines by a Regular Rewrite Rule. Theor. Comput. Sci. 103(2): 409-420 (1992)

Max Dauchet, Sophie Tison: Structural complexity of classes of tree languages. Tree Automata and Languages 1992: 327-354

Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi: Bottom-Up Tree Pushdown Automata and Rewrite Systems. RTA 1991: 287-298

Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison: Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems. Inf. Comput. 88(2): 187-201 (1990)

Max Dauchet, Sophie Tison: The Theory of Ground Rewrite Systems is Decidable. LICS 1990: 242-248

Jean-Luc Coquidé, Max Dauchet, Sophie Tison: About Connections Between Syntactical and Computational Complexity. FCT 1989: 105-115

Max Dauchet: Simulation of Turning Machines by a Left-Linear Rewrite Rule. RTA 1989: 109-120

Max Dauchet, Aline Deruyver: Compilation of Ground Term Rewriting Systems and Applications. RTA 1989: 556-558

Francis Bossut, Max Dauchet, Bruno Warin: Automata and Rational Expressions on Planar Graphs. MFCS 1988: 190-200

Max Dauchet: Termination of Rewriting is Undecidable in the One-Rule Case. MFCS 1988: 262-270

Max Dauchet, Maurice Nivat (Eds.): CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings. Lecture Notes in Computer Science 299, Springer 1988, isbn 3-540-19021-X

Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne: Decidability of the Confluence of Ground Term Rewriting Systems. LICS 1987: 353-359

Max Dauchet, Francesco De Comité: A Gap Between Linear and Non Linear Term-Rewriting Systems (1). RTA 1987: 95-104

Max Dauchet, Erick Timmerman: Continuous Monoids and Yields of Infinite Trees. ITA 20(3): 251-274 (1986)

Max Dauchet, Sophie Tison: Decidability of confluence for ground term rewriting systems. FCT 1985: 80-89

Max Dauchet, Erick Timmerman: Decidability of yield's equality for infinite regular trees. Automata on Infinite Words 1984: 118-136

Sophie Tison, Max Dauchet, Gérard Comyn: Metrical an Ordered Properties of Powerdomains. FCT 1983: 465-474

André Arnold, Max Dauchet: Morphismes et Bimorphismes d'Arbres. Theor. Comput. Sci. 20: 33-93 (1982)

Gérard Comyn, Max Dauchet: Approximations of Infinitary Objects. ICALP 1982: 116-127

André Arnold, Max Dauchet: Théorie des Magmoïdes (II). ITA 13(2) (1979)

Max Dauchet, Jocelyne Mongy: Transformations de noyaux reconnaissables. FCT 1979: 92-98

André Arnold, Max Dauchet: Forêts Algébriques et Homomorphismes Inverses. Information and Control 37(2): 182-196 (1978)

André Arnold, Max Dauchet: Théorie des magmoïdes. ITA 12(3) (1978)

André Arnold, Max Dauchet: Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. Mathematical Systems Theory 12: 103-128 (1978)

André Arnold, Max Dauchet: Sul l'inversion des morphisms d'arbres. ICALP 1978: 26-35

André Arnold, Max Dauchet: Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. ITA 10(1): 5-28 (1976)

André Arnold, Max Dauchet: Un Théorème de Duplication pour les Forêts Algébriques. J. Comput. Syst. Sci. 13(2): 223-244 (1976)

André Arnold, Max Dauchet: Bi-transductions de forêts. ICALP 1976: 74-86