Max Dauchet

48 papers A* 7B 8Misc 1Journal 21Unranked 8
YearRankTypeTitle / Venue / Authors
2017 J jnl
Ethics in Robotics Research: CERNA Mission and Context.
IEEE Robotics Autom. Mag.
Alexei Grinbaum, Raja Chatila, Laurence Devillers, Jean-Gabriel Ganascia, Catherine Tessier, Max Dauchet
2003 J jnl
Finding the common structure shared by two homologous RNAs.
Bioinform.
Olivier Perriquet, Hélène Touzet, Max Dauchet
2002 J jnl
Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms.
Theor. Comput. Sci.
Max Dauchet, Sophie Tison, Marc Tommasi
2000 J jnl
Trees in Algebra and Programming (Editorial).
Theor. Comput. Sci.
Max Dauchet
1999 Misc conf
Location of Repetitive Regions in Sequences By Optimizing A Compression Method.
Pacific Symposium on Biocomputing
Olivier Delgrange, Max Dauchet, Eric Rivals
1999 A* conf
Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval.
IJCAI
Arnaud Delhay, Max Dauchet, Patrick Taillibert, Philippe Vanheeghe
1998 B conf
Deterministic Rational Transducers and Random Sequences.
FoSSaCS
Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin
1997 J jnl
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences.
Comput. Appl. Biosci.
Eric Rivals, Olivier Delgrange, Jean-Paul Delahaye, Max Dauchet, Marie-Odile Delorme, Alain Hénaut, Emmanuelle Ollivier
1997 — ed.
TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings
TAPSOFT
Michel Bidoit, Max Dauchet
1997 J jnl
The Fractal Dimension of a Computable Figure is the Average Normalized Complexity of its Points.
Bull. EATCS
Sylvain Porrot, Max Dauchet, Denis Pomorski
1996 B conf
A Guaranteed Compression Scheme for Repetitive DNA Sequences.
Data Compression Conference
Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange
1995 J jnl
A Kleene Theorem for a Class of Planar Acyclic Graphs
Inf. Comput.
Francis Bossut, Max Dauchet, Bruno Warin
1995 J jnl
Automata for Reduction Properties Solving.
J. Symb. Comput.
Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé
1994 J jnl
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
Theor. Comput. Sci.
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
1994 J jnl
Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers.
RAIRO Theor. Informatics Appl.
Yves Andre, Max Dauchet
1994 A* conf
Pumping, Cleaning and Symbolic Constraints Solving.
ICALP
Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
1994 — conf
Symbolic Constraints and Tree Automata.
CCL
Max Dauchet
1993 — conf
Encompassment Properties and Automata with Constraints.
RTA
Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet
1993 — conf
Rewriting and Tree Automata.
Term Rewriting
Max Dauchet
1993 J jnl
Weighted Systems of Equations.
Theor. Comput. Sci.
Philippe Devienne, Patrick Lebègue, Max Dauchet
1992 J jnl
Simulation of Turing Machines by a Regular Rewrite Rule.
Theor. Comput. Sci.
Max Dauchet
1992 — ch.
Structural complexity of classes of tree languages.
Tree Automata and Languages
Max Dauchet, Sophie Tison
1991 — conf
Bottom-Up Tree Pushdown Automata and Rewrite Systems.
RTA
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
1990 J jnl
Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems
Inf. Comput.
Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison
1990 A* conf
The Theory of Ground Rewrite Systems is Decidable
LICS
Max Dauchet, Sophie Tison
1989 B conf
About Connections Between Syntactical and Computational Complexity.
FCT
Jean-Luc Coquidé, Max Dauchet, Sophie Tison
1989 — conf
Compilation of Ground Term Rewriting Systems and Applications.
RTA
Max Dauchet, Aline Deruyver
1989 — conf
Simulation of Turning Machines by a Left-Linear Rewrite Rule.
RTA
Max Dauchet
1988 B conf
Automata and Rational Expressions on Planar Graphs.
MFCS
Francis Bossut, Max Dauchet, Bruno Warin
1988 — ed.
CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings
CAAP
Max Dauchet, Maurice Nivat
1988 B conf
Termination of Rewriting is Undecidable in the One-Rule Case.
MFCS
Max Dauchet
1987 — conf
A Gap Between Linear and Non Linear Term-Rewriting Systems (1).
RTA
Max Dauchet, Francesco De Comité
1987 A* conf
Decidability of the Confluence of Ground Term Rewriting Systems
LICS
Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne
1986 J jnl
Continuous Monoids and Yields of Infinite Trees.
RAIRO Theor. Informatics Appl.
Max Dauchet, Erick Timmerman
1985 B conf
Decidability of confluence for ground term rewriting systems.
FCT
Max Dauchet, Sophie Tison
1984 — conf
Decidability of yield's equality for infinite regular trees.
Automata on Infinite Words
Max Dauchet, Erick Timmerman
1983 B conf
Metrical an Ordered Properties of Powerdomains.
FCT
Sophie Tison, Max Dauchet, Gérard Comyn
1982 A* conf
Approximations of Infinitary Objects.
ICALP
Gérard Comyn, Max Dauchet
1982 J jnl
Morphismes et Bimorphismes d'Arbres.
Theor. Comput. Sci.
André Arnold, Max Dauchet
1979 J jnl
Théorie des Magmoïdes (II).
RAIRO Theor. Informatics Appl.
André Arnold, Max Dauchet
1979 B conf
Transformations de noyaux reconnaissables.
FCT
Max Dauchet, Jocelyne Mongy
1978 J jnl
Forêts Algébriques et Homomorphismes Inverses
Inf. Control.
André Arnold, Max Dauchet
1978 A* conf
Sul l'inversion des morphisms d'arbres.
ICALP
André Arnold, Max Dauchet
1978 J jnl
Théorie des magmoïdes.
RAIRO Theor. Informatics Appl.
André Arnold, Max Dauchet
1978 J jnl
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables.
Math. Syst. Theory
André Arnold, Max Dauchet
1976 A* conf
Bi-transductions de forêts.
ICALP
André Arnold, Max Dauchet
1976 J jnl
Transductions de Forets Reconnaissables Monadiques Forets Coregulieres.
RAIRO Theor. Informatics Appl.
André Arnold, Max Dauchet
1976 J jnl
Un Théorème de Duplication pour les Forêts Algébriques.
J. Comput. Syst. Sci.
André Arnold, Max Dauchet