Max Dauchet

Publication Activity (10 Years)

Years Active: 1976-2017
Publications (10 Years): 1

Top Topics

Knowledge Retrieval

Context Sensitive

Top Venues

IEEE Robotics Autom. Mag.

Publications

Alexei Grinbaum, Raja Chatila, Laurence Devillers, Jean-Gabriel Ganascia, Catherine Tessier, Max Dauchet
Ethics in Robotics Research: CERNA Mission and Context. IEEE Robotics Autom. Mag. 24 (3) (2017)
Olivier Perriquet, Hélène Touzet, Max Dauchet
Finding the common structure shared by two homologous RNAs. Bioinform. 19 (1) (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) (2002)
Max Dauchet
Trees in Algebra and Programming (Editorial). Theor. Comput. Sci. 236 (1-2) (2000)
Olivier Delgrange, Max Dauchet, Eric Rivals
Location of Repetitive Regions in Sequences By Optimizing A Compression Method. Pacific Symposium on Biocomputing (1999)
Arnaud Delhay, Max Dauchet, Patrick Taillibert, Philippe Vanheeghe
Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval. IJCAI (1999)
Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin
Deterministic Rational Transducers and Random Sequences. FoSSaCS (1998)
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. Comput. Appl. Biosci. 13 (2) (1997)
Sylvain Porrot, Max Dauchet, Denis Pomorski
The Fractal Dimension of a Computable Figure is the Average Normalized Complexity of its Points. Bull. EATCS 62 (1997)
Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange
A Guaranteed Compression Scheme for Repetitive DNA Sequences. Data Compression Conference (1996)
Francis Bossut, Max Dauchet, Bruno Warin
A Kleene Theorem for a Class of Planar Acyclic Graphs Inf. Comput. 117 (2) (1995)
Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé
Automata for Reduction Properties Solving. J. Symb. Comput. 20 (2) (1995)
Yves Andre, Max Dauchet
Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers. RAIRO Theor. Informatics Appl. 28 (5) (1994)
Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
Pumping, Cleaning and Symbolic Constraints Solving. ICALP (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) (1994)
Max Dauchet
Symbolic Constraints and Tree Automata. CCL (1994)
Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet
Encompassment Properties and Automata with Constraints. RTA (1993)
Max Dauchet
Rewriting and Tree Automata. Term Rewriting (1993)
Philippe Devienne, Patrick Lebègue, Max Dauchet
Weighted Systems of Equations. Theor. Comput. Sci. 119 (1) (1993)
Max Dauchet
Simulation of Turing Machines by a Regular Rewrite Rule. Theor. Comput. Sci. 103 (2) (1992)
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
Bottom-Up Tree Pushdown Automata and Rewrite Systems. RTA (1991)
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) (1990)
Max Dauchet, Sophie Tison
The Theory of Ground Rewrite Systems is Decidable LICS (1990)
Max Dauchet, Aline Deruyver
Compilation of Ground Term Rewriting Systems and Applications. RTA (1989)
Max Dauchet
Simulation of Turning Machines by a Left-Linear Rewrite Rule. RTA (1989)
Jean-Luc Coquidé, Max Dauchet, Sophie Tison
About Connections Between Syntactical and Computational Complexity. FCT (1989)
Francis Bossut, Max Dauchet, Bruno Warin
Automata and Rational Expressions on Planar Graphs. MFCS (1988)
Max Dauchet
Termination of Rewriting is Undecidable in the One-Rule Case. MFCS (1988)
Max Dauchet, Francesco De Comité
A Gap Between Linear and Non Linear Term-Rewriting Systems (1). RTA (1987)
Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne
Decidability of the Confluence of Ground Term Rewriting Systems LICS (1987)
Max Dauchet, Erick Timmerman
Continuous Monoids and Yields of Infinite Trees. RAIRO Theor. Informatics Appl. 20 (3) (1986)
Max Dauchet, Sophie Tison
Decidability of confluence for ground term rewriting systems. FCT (1985)
Max Dauchet, Erick Timmerman
Decidability of yield's equality for infinite regular trees. Automata on Infinite Words (1984)
Sophie Tison, Max Dauchet, Gérard Comyn
Metrical an Ordered Properties of Powerdomains. FCT (1983)
Gérard Comyn, Max Dauchet
Approximations of Infinitary Objects. ICALP (1982)
André Arnold, Max Dauchet
Morphismes et Bimorphismes d'Arbres. Theor. Comput. Sci. 20 (1982)
André Arnold, Max Dauchet
Théorie des Magmoïdes (II). RAIRO Theor. Informatics Appl. 13 (2) (1979)
Max Dauchet, Jocelyne Mongy
Transformations de noyaux reconnaissables. FCT (1979)
André Arnold, Max Dauchet
Forêts Algébriques et Homomorphismes Inverses Inf. Control. 37 (2) (1978)
André Arnold, Max Dauchet
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. Math. Syst. Theory 12 (1978)
André Arnold, Max Dauchet
Théorie des magmoïdes. RAIRO Theor. Informatics Appl. 12 (3) (1978)
André Arnold, Max Dauchet
Sul l'inversion des morphisms d'arbres. ICALP (1978)
André Arnold, Max Dauchet
Bi-transductions de forêts. ICALP (1976)
André Arnold, Max Dauchet
Un Théorème de Duplication pour les Forêts Algébriques. J. Comput. Syst. Sci. 13 (2) (1976)
André Arnold, Max Dauchet
Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. RAIRO Theor. Informatics Appl. 10 (1) (1976)