Bi-transductions de forêts. - André Arnold; Max Dauchet (ICALP, 1976)

Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. - André Arnold; Max Dauchet (RAIRO Theor. Informatics Appl., 1976)

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

Sul l'inversion des morphisms d'arbres. - André Arnold; Max Dauchet (ICALP, 1978)

Théorie des magmoïdes. - André Arnold; Max Dauchet (RAIRO Theor. Informatics Appl., 1978)

Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. - André Arnold; Max Dauchet (Math. Syst. Theory, 1978)

Forêts Algébriques et Homomorphismes Inverses - André Arnold; Max Dauchet (Inf. Control., 1978)

Transformations de noyaux reconnaissables. - Max Dauchet; Jocelyne Mongy (FCT, 1979)

Théorie des Magmoïdes (II). - André Arnold; Max Dauchet (RAIRO Theor. Informatics Appl., 1979)

Approximations of Infinitary Objects. - Gérard Comyn; Max Dauchet (ICALP, 1982)

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

Metrical an Ordered Properties of Powerdomains. - Sophie Tison; Max Dauchet; Gérard Comyn (FCT, 1983)

Decidability of yield's equality for infinite regular trees. - Max Dauchet; Erick Timmerman (Automata on Infinite Words, 1984)

Decidability of confluence for ground term rewriting systems. - Max Dauchet; Sophie Tison (FCT, 1985)

Continuous Monoids and Yields of Infinite Trees. - Max Dauchet; Erick Timmerman (RAIRO Theor. Informatics Appl., 1986)

Decidability of the Confluence of Ground Term Rewriting Systems - Max Dauchet; Sophie Tison; Thierry Heuillard; Pierre Lescanne (LICS, 1987)

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

Automata and Rational Expressions on Planar Graphs. - Francis Bossut; Max Dauchet; Bruno Warin (MFCS, 1988)

Termination of Rewriting is Undecidable in the One-Rule Case. - Max Dauchet (MFCS, 1988)

About Connections Between Syntactical and Computational Complexity. - Jean-Luc Coquidé; Max Dauchet; Sophie Tison (FCT, 1989)

Simulation of Turning Machines by a Left-Linear Rewrite Rule. - Max Dauchet (RTA, 1989)

Compilation of Ground Term Rewriting Systems and Applications. - Max Dauchet; Aline Deruyver (RTA, 1989)

The Theory of Ground Rewrite Systems is Decidable - Max Dauchet; Sophie Tison (LICS, 1990)

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

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

Structural complexity of classes of tree languages. - Max Dauchet; Sophie Tison (Tree Automata and Languages, 1992)

Simulation of Turing Machines by a Regular Rewrite Rule. - Max Dauchet (Theor. Comput. Sci., 1992)

Rewriting and Tree Automata. - Max Dauchet (Term Rewriting, 1993)

Encompassment Properties and Automata with Constraints. - Anne-Cécile Caron; Jean-Luc Coquidé; Max Dauchet (RTA, 1993)

Weighted Systems of Equations. - Philippe Devienne; Patrick Lebègue; Max Dauchet (Theor. Comput. Sci., 1993)

Symbolic Constraints and Tree Automata. - Max Dauchet (CCL, 1994)

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

Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers. - Yves Andre; Max Dauchet (RAIRO Theor. Informatics Appl., 1994)

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

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

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

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

Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. - Eric Rivals; Olivier Delgrange; Jean-Paul Delahaye; Max Dauchet; Marie-Odile Delorme; Alain Hénaut; Emmanuelle Ollivier (Comput. Appl. Biosci., 1997)

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

Deterministic Rational Transducers and Random Sequences. - Sylvain Porrot; Max Dauchet; Bruno Durand 001; Nikolai K. Vereshchagin (FoSSaCS, 1998)

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

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

Trees in Algebra and Programming (Editorial). - Max Dauchet (Theor. Comput. Sci., 2000)

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

Finding the common structure shared by two homologous RNAs. - Olivier Perriquet; Hélène Touzet; Max Dauchet (Bioinform., 2003)

Ethics in Robotics Research: CERNA Mission and Context. - Alexei Grinbaum; Raja Chatila 001; Laurence Devillers; Jean-Gabriel Ganascia; Catherine Tessier; Max Dauchet (IEEE Robotics Autom. Mag., 2017)