UNE RELATION D'EQUIVALENCE DECIDABLE SUR LA CLASSE DES FORETS RECONNAISSABLESARNOLD A; DAUCHET M.1978; MATH. SYST. THEORY; USA; DA. 1978; VOL. 12; NO 2; PP. 103-128; ABS. ENG; BIBL. 10 REF.Article

APPROXIMATION OF INFINITARY OBJECTSCOMYN G; DAUCHET M.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 116-127; BIBL. 19 REF.Conference Paper

THEORIE DES MAGMOIDES. IIARNOLD A; DAUCHET M.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 2; PP. 135-154; ABS. ENG; BIBL. 4 REF.Article

SUR L'INVERSION DES MORPHISMES D'ARBRES.ARNOLD A; DAUCHET M.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 26-35; BIBL. 1 P. 1/2; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

THEORIE DES MAGMOIDESARNOLD A; DAUCHET M.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 3; PP. 235-257; BIBL. 26 REF.Article

Trees in Algebra and ProgrammingDAUCHET, M.Theoretical computer science. 2000, Vol 236, Num 1-2, issn 0304-3975, 234 p.Serial Issue

A PROPOS D'UN LANGAGE PRESQUE RATIONNELDAUCHET M; LATTEUX M.1981; C.R. SEANCES ACAD. SCI., SER. 1; FRA; DA. 1981; VOL. 292; NO 1; PP. 107-110; ABS. ENG; BIBL. 7 REF.Article

BI-TRANSDUCTION DE FORETS.ARNOLD A; DAUCHET M.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 74-86; BIBL. 1 P. 1/2Conference Paper

UN THEOREME DE DUPLICATION POUR LES FORETS ALGEBRIQUES.ARNOLD A; DAUCHET M.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 2; PP. 223-244; BIBL. 15 REF.Article

Decidability of equivalence for a class of non-deterministic tree transducersANDRE, Y; DAUCHET, M.Informatique théorique et applications (Imprimé). 1994, Vol 28, Num 5, pp 447-463, issn 0988-3754Article

Deterministic rational transducers and random sequencesPORROT, S; DAUCHET, M; DURAND, B et al.Lecture notes in computer science. 1998, pp 258-272, issn 0302-9743, isbn 3-540-64300-1Conference Paper

Detection of significant patterns by compression algorithms : the case of approximate tandem repeats in DNA sequencesRIVALS, E; DELGRANGE, O; DELAHAYE, J.-P et al.Computer applications in the biosciences (Print). 1997, Vol 13, Num 2, pp 131-136, issn 0266-7061Article

Finding the common structure shared by two homologous RNAsPERRIQUET, O; TOUZET, H; DAUCHET, M et al.Bioinformatics (Oxford. Print). 2003, Vol 19, Num 1, pp 108-116, issn 1367-4803, 9 p.Article

Maximum packing for k-connected partial k-trees in polynomial timeDESSMARK, A; LINGAS, A; PROSKUROWSKI, A et al.Theoretical computer science. 2000, Vol 236, Num 1-2, pp 179-191, issn 0304-3975Article

Weighted systems of equationsDEVIENNE, P; LEBEGUE, P; DAUCHET, M et al.Theoretical computer science. 1993, Vol 119, Num 1, pp 39-62, issn 0304-3975Conference Paper

Algorithmes de compression et applications à l'analyse de séquences génétiques = Compression algorithms and applications to genetic sequences analysisRivals, Eric; Dauchet, M.1996, 162 p.Thesis

Formalism and methodASTESIANO, E; REGGIO, G.Theoretical computer science. 2000, Vol 236, Num 1-2, pp 3-34, issn 0304-3975Article

Termination of term rewriting using dependency pairsARTS, T; GIESL, J.Theoretical computer science. 2000, Vol 236, Num 1-2, pp 133-178, issn 0304-3975Article

Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systemsDAUCHET, M; HEUILLARD, T; LESCANNE, P et al.Information and computation (Print). 1990, Vol 88, Num 2, pp 187-201, issn 0890-5401, 15 p.Article

Logicality of conditional rewrite systemsYAMADA, T; AVENHAUS, J; LORIA-SAENZ, C et al.Theoretical computer science. 2000, Vol 236, Num 1-2, pp 209-232, issn 0304-3975Article

CAAP '88: proceedings/13th. Colloquium on trees in algebra and programming, Nancy, France, March 21-24, 1988DAUCHET, M; NIVAT, M.Lecture notes in computer science. 1988, Vol 299, issn 0302-9743, VIII-304 pConference Proceedings

Bottom-up tree pushdown automata: classification and connection with rewrite systemsCOQUIDE, J.-L; DAUCHET, M; GILLERON, R et al.Theoretical computer science. 1994, Vol 127, Num 1, pp 69-98, issn 0304-3975Article

Représentation de connaissances et complexité de Kolmogorov. Le cas du dessin au trait = Knowledge recognition and Kolmogorov complexity. Case of outline drawingBinse, Michel; Dauchet, M.1994, 244 p.Thesis