Max Dauchet

According to our database, Max Dauchet authored at least 46 papers between 1976 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Ethics in Robotics Research: CERNA Mission and Context.

Alexei Grinbaum, Raja Chatila, Laurence Devillers, Jean-Gabriel Ganascia, Catherine Tessier, Max Dauchet

IEEE Robotics Autom. Mag., 2017

2003

Finding the common structure shared by two homologous RNAs.

Olivier Perriquet, Hélène Touzet, Max Dauchet

Bioinform., 2003

2002

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

2000

Trees in Algebra and Programming (Editorial).

Max Dauchet

Theor. Comput. Sci., 2000

1999

Location of Repetitive Regions in Sequences By Optimizing A Compression Method.

Olivier Delgrange, Max Dauchet, Eric Rivals

Proceedings of the 4th Pacific Symposium on Biocomputing, 1999

Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval.

Arnaud Delhay, Max Dauchet, Patrick Taillibert, Philippe Vanheeghe

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1998

Deterministic Rational Transducers and Random Sequences.

Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin

Proceedings of the Foundations of Software Science and Computation Structure, 1998

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

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

1996

A Guaranteed Compression Scheme for Repetitive DNA Sequences.

Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995

A Kleene Theorem for a Class of Planar Acyclic Graphs

Francis Bossut, Max Dauchet, Bruno Warin

Inf. Comput., March, 1995

Automata for Reduction Properties Solving.

Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé

J. Symb. Comput., 1995

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

Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers.

Yves Andre, Max Dauchet

RAIRO Theor. Informatics Appl., 1994

Pumping, Cleaning and Symbolic Constraints Solving.

Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Symbolic Constraints and Tree Automata.

Max Dauchet

Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1993

Weighted Systems of Equations.

Philippe Devienne, Patrick Lebègue, Max Dauchet

Theor. Comput. Sci., 1993

Encompassment Properties and Automata with Constraints.

Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet

Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

Rewriting and Tree Automata.

Max Dauchet

Proceedings of the Term Rewriting, 1993

1992

Simulation of Turing Machines by a Regular Rewrite Rule.

Max Dauchet

Theor. Comput. Sci., 1992

Structural complexity of classes of tree languages.

Max Dauchet, Sophie Tison

Proceedings of the Tree Automata and Languages., 1992

1991

Bottom-Up Tree Pushdown Automata and Rewrite Systems.

Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

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., October, 1990

The Theory of Ground Rewrite Systems is Decidable

Max Dauchet, Sophie Tison

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989

Compilation of Ground Term Rewriting Systems and Applications.

Max Dauchet, Aline Deruyver

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

Simulation of Turning Machines by a Left-Linear Rewrite Rule.

Max Dauchet

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

About Connections Between Syntactical and Computational Complexity.

Jean-Luc Coquidé, Max Dauchet, Sophie Tison

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Termination of Rewriting is Undecidable in the One-Rule Case.

Max Dauchet

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Automata and Rational Expressions on Planar Graphs.

Francis Bossut, Max Dauchet, Bruno Warin

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

A Gap Between Linear and Non Linear Term-Rewriting Systems (1).

Max Dauchet, Francesco De Comité

Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Decidability of the Confluence of Ground Term Rewriting Systems

Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986

Continuous Monoids and Yields of Infinite Trees.

Max Dauchet, Erick Timmerman

RAIRO Theor. Informatics Appl., 1986

1985

Decidability of confluence for ground term rewriting systems.

Max Dauchet, Sophie Tison

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Decidability of yield's equality for infinite regular trees.

Max Dauchet, Erick Timmerman

Proceedings of the Automata on Infinite Words, 1984

1983

Metrical an Ordered Properties of Powerdomains.

Sophie Tison, Max Dauchet, Gérard Comyn

Proceedings of the Fundamentals of Computation Theory, 1983

1982

Morphismes et Bimorphismes d'Arbres.

André Arnold, Max Dauchet

Theor. Comput. Sci., 1982

Approximations of Infinitary Objects.

Gérard Comyn, Max Dauchet

Proceedings of the Automata, 1982

1979

Théorie des Magmoïdes (II).

André Arnold, Max Dauchet

RAIRO Theor. Informatics Appl., 1979

Transformations de noyaux reconnaissables.

Max Dauchet, Jocelyne Mongy

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Forêts Algébriques et Homomorphismes Inverses

André Arnold, Max Dauchet

Inf. Control., May, 1978

Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables.

André Arnold, Max Dauchet

Math. Syst. Theory, 1978

Théorie des magmoïdes.

André Arnold, Max Dauchet

RAIRO Theor. Informatics Appl., 1978

Sul l'inversion des morphisms d'arbres.

André Arnold, Max Dauchet

Proceedings of the Automata, 1978

1976

Un Théorème de Duplication pour les Forêts Algébriques.

André Arnold, Max Dauchet

J. Comput. Syst. Sci., 1976

Transductions de Forets Reconnaissables Monadiques Forets Coregulieres.

André Arnold, Max Dauchet

RAIRO Theor. Informatics Appl., 1976

Bi-transductions de forêts.

André Arnold, Max Dauchet

Proceedings of the Third International Colloquium on Automata, 1976