dblp.uni-trier.dewww.uni-trier.de

Max Dauchet Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2003
47 Olivier Perriquet, Hélène Touzet, Max Dauchet: Finding the common structure shared by two homologous RNAs. Bioinformatics 19(1): 108-116 (2003)
2002
46EEMax 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)
2000
45EEMax Dauchet: Trees in Algebra and Programming (Editorial). Theor. Comput. Sci. 236(1-2): 1 (2000)
1999
44 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
43EEOlivier Delgrange, Max Dauchet, Eric Rivals: Location of Repetitive Regions in Sequences By Optimizing A Compression Method. Pacific Symposium on Biocomputing 1999: 254-265
1998
42EESylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin: Deterministic Rational Transducers and Random Sequences. FoSSaCS 1998: 258-272
1997
41 Michel Bidoit, Max Dauchet: TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings Springer 1997
40 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)
39 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)
1996
38 Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange: A Guaranteed Compression Scheme for Repetitive DNA Sequences. Data Compression Conference 1996: 453
1995
37 Francis Bossut, Max Dauchet, Bruno Warin: A Kleene Theorem for a Class of Planar Acyclic Graphs Inf. Comput. 117(2): 251-265 (1995)
36 Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé: Automata for Reduction Properties Solving. J. Symb. Comput. 20(2): 215-233 (1995)
1994
35 Max Dauchet: Symbolic Constraints and Tree Automata. CCL 1994: 217-218
34EEAnne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard: Pumping, Cleaning and Symbolic Constraints Solving. ICALP 1994: 436-449
33 Yves Andre, Max Dauchet: Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers. ITA 28(5): 447-463 (1994)
32 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)
1993
31EEAnne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet: Encompassment Properties and Automata with Constraints. RTA 1993: 328-342
30 Max Dauchet: Rewriting and Tree Automata. Term Rewriting 1993: 95-113
29 Philippe Devienne, Patrick Lebègue, Max Dauchet: Weighted Systems of Equations. Theor. Comput. Sci. 119(1): 39-62 (1993)
1992
28 Max Dauchet, Sophie Tison: Structural complexity of classes of tree languages. Tree Automata and Languages 1992: 327-354
27 Max Dauchet: Simulation of Turing Machines by a Regular Rewrite Rule. Theor. Comput. Sci. 103(2): 409-420 (1992)
1991
26EEJean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi: Bottom-Up Tree Pushdown Automata and Rewrite Systems. RTA 1991: 287-298
1990
25 Max Dauchet, Sophie Tison: The Theory of Ground Rewrite Systems is Decidable LICS 1990: 242-248
24 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)
1989
23 Jean-Luc Coquidé, Max Dauchet, Sophie Tison: About Connections Between Syntactical and Computational Complexity. FCT 1989: 105-115
22EEMax Dauchet: Simulation of Turning Machines by a Left-Linear Rewrite Rule. RTA 1989: 109-120
21EEMax Dauchet, Aline Deruyver: Compilation of Ground Term Rewriting Systems and Applications. RTA 1989: 556-558
1988
20 Max Dauchet, Maurice Nivat: CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings Springer 1988
19EEFrancis Bossut, Max Dauchet, Bruno Warin: Automata and Rational Expressions on Planar Graphs. MFCS 1988: 190-200
18EEMax Dauchet: Termination of Rewriting is Undecidable in the One-Rule Case. MFCS 1988: 262-270
1987
17 Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne: Decidability of the Confluence of Ground Term Rewriting Systems LICS 1987: 353-359
16EEMax Dauchet, Francesco De Comité: A Gap Between Linear and Non Linear Term-Rewriting Systems (1). RTA 1987: 95-104
1986
15 Max Dauchet, Erick Timmerman: Continuous Monoids and Yields of Infinite Trees. ITA 20(3): 251-274 (1986)
1985
14 Max Dauchet, Sophie Tison: Decidability of confluence for ground term rewriting systems. FCT 1985: 80-89
1984
13EEMax Dauchet, Erick Timmerman: Decidability of yield's equality for infinite regular trees. Automata on Infinite Words 1984: 118-136
1983
12 Sophie Tison, Max Dauchet, Gérard Comyn: Metrical an Ordered Properties of Powerdomains. FCT 1983: 465-474
1982
11EEGérard Comyn, Max Dauchet: Approximations of Infinitary Objects. ICALP 1982: 116-127
10 André Arnold, Max Dauchet: Morphismes et Bimorphismes d'Arbres. Theor. Comput. Sci. 20: 33-93 (1982)
1979
9 Max Dauchet, Jocelyne Mongy: Transformations de noyaux reconnaissables. FCT 1979: 92-98
8 André Arnold, Max Dauchet: Théorie des Magmoïdes (II). ITA 13(2): (1979)
1978
7EEAndré Arnold, Max Dauchet: Sul l'inversion des morphisms d'arbres. ICALP 1978: 26-35
6 André Arnold, Max Dauchet: Théorie des magmoïdes. ITA 12(3): (1978)
5 André Arnold, Max Dauchet: Forêts Algébriques et Homomorphismes Inverses Information and Control 37(2): 182-196 (1978)
4 André Arnold, Max Dauchet: Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. Mathematical Systems Theory 12: 103-128 (1978)
1976
3 André Arnold, Max Dauchet: Bi-transductions de forêts. ICALP 1976: 74-86
2 André Arnold, Max Dauchet: Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. ITA 10(1): 5-28 (1976)
1 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)

Coauthor Index

1Yves Andre [33]
2André Arnold [1] [2] [3] [4] [5] [6] [7] [8] [10]
3Michel Bidoit [41]
4Francis Bossut [19] [37]
5Anne-Cécile Caron [31] [34] [36]
6Francesco De Comité [16]
7Hubert Comon-Lundh (Hubert Comon) [34]
8Gérard Comyn [11] [12]
9Jean-Luc Coquidé [23] [26] [31] [32] [34] [36]
10Jean-Paul Delahaye [38] [39]
11Olivier Delgrange [38] [39] [43]
12Arnaud Delhay [44]
13Marie-Odile Delorme [39]
14Aline Deruyver [21]
15Philippe Devienne [29]
16Bruno Durand [42]
17Rémi Gilleron [26] [32]
18Alain Hénaut [39]
19Thierry Heuillard [17] [24]
20Florent Jacquemard [34]
21Patrick Lebègue [29]
22Pierre Lescanne [17] [24]
23Jocelyne Mongy [9]
24Maurice Nivat [20]
25Emmanuelle Ollivier [39]
26Olivier Perriquet [47]
27Denis Pomorski [40]
28Sylvain Porrot [40] [42]
29Eric Rivals [38] [39] [43]
30Patrick Taillibert [44]
31Erick Timmerman [13] [15]
32Sophie Tison [12] [14] [17] [23] [24] [25] [28] [46]
33Marc Tommasi [46]
34Hélène Touzet [47]
35Sándor Vágvölgyi [26] [32]
36Philippe Vanheeghe [44]
37Nikolai K. Vereshchagin [42]
38Bruno Warin [19] [37]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)