default search action
Max Dauchet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j21]Alexei Grinbaum
, Raja Chatila
Ethics in Robotics Research: CERNA Mission and Context. IEEE Robotics Autom. Mag. 24(3): 139-145 (2017)
2000 – 2009
- 2003
- [j20]Olivier Perriquet
Finding the common structure shared by two homologous RNAs. Bioinform. 19(1): 108-116 (2003) - 2002
- [j19]Max Dauchet, Sophie Tison
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
- [j18]Max Dauchet:
Trees in Algebra and Programming (Editorial). Theor. Comput. Sci. 236(1-2): 1 (2000)
1990 – 1999
- 1999
- [c24]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 - [c23]Olivier Delgrange, Max Dauchet, Eric Rivals:
Location of Repetitive Regions in Sequences By Optimizing A Compression Method. Pacific Symposium on Biocomputing 1999: 254-265 - 1998
- [c22]Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin:
Deterministic Rational Transducers and Random Sequences. FoSSaCS 1998: 258-272 - 1997
- [j17]Eric Rivals
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. Comput. Appl. Biosci. 13(2): 131-136 (1997) - [j16]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) - [e2]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. Lecture Notes in Computer Science 1214, Springer 1997, ISBN 3-540-62781-2 [contents] - 1996
- [c21]Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange:
A Guaranteed Compression Scheme for Repetitive DNA Sequences. Data Compression Conference 1996: 453 - 1995
- [j15]Francis Bossut, Max Dauchet, Bruno Warin:
A Kleene Theorem for a Class of Planar Acyclic Graphs. Inf. Comput. 117(2): 251-265 (1995) - [j14]Max Dauchet, Anne-Cécile Caron
Automata for Reduction Properties Solving. J. Symb. Comput. 20(2): 215-233 (1995) - 1994
- [j13]Yves Andre, Max Dauchet:
Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers. RAIRO Theor. Informatics Appl. 28(5): 447-463 (1994) - [j12]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) - [c20]Max Dauchet:
Symbolic Constraints and Tree Automata. CCL 1994: 217-218 - [c19]Anne-Cécile Caron
Pumping, Cleaning and Symbolic Constraints Solving. ICALP 1994: 436-449 - 1993
- [j11]Philippe Devienne, Patrick Lebègue, Max Dauchet:
Weighted Systems of Equations. Theor. Comput. Sci. 119(1): 39-62 (1993) - [c18]Max Dauchet:
Rewriting and Tree Automata. Term Rewriting 1993: 95-113 - [c17]Anne-Cécile Caron
Encompassment Properties and Automata with Constraints. RTA 1993: 328-342 - 1992
- [j10]Max Dauchet:
Simulation of Turing Machines by a Regular Rewrite Rule. Theor. Comput. Sci. 103(2): 409-420 (1992) - [p1]Max Dauchet, Sophie Tison:
Structural complexity of classes of tree languages. Tree Automata and Languages 1992: 327-354 - 1991
- [c16]Jean-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
- [j9]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) - [c15]Max Dauchet, Sophie Tison
The Theory of Ground Rewrite Systems is Decidable. LICS 1990: 242-248
1980 – 1989
- 1989
- [c14]Jean-Luc Coquidé, Max Dauchet, Sophie Tison
About Connections Between Syntactical and Computational Complexity. FCT 1989: 105-115 - [c13]Max Dauchet:
Simulation of Turning Machines by a Left-Linear Rewrite Rule. RTA 1989: 109-120 - [c12]Max Dauchet, Aline Deruyver:
Compilation of Ground Term Rewriting Systems and Applications. RTA 1989: 556-558 - 1988
- [c11]Francis Bossut, Max Dauchet, Bruno Warin:
Automata and Rational Expressions on Planar Graphs. MFCS 1988: 190-200 - [c10]Max Dauchet:
Termination of Rewriting is Undecidable in the One-Rule Case. MFCS 1988: 262-270 - [e1]Max Dauchet, Maurice Nivat:
CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings. Lecture Notes in Computer Science 299, Springer 1988, ISBN 3-540-19021-X [contents] - 1987
- [c9]Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne:
Decidability of the Confluence of Ground Term Rewriting Systems. LICS 1987: 353-359 - [c8]Max Dauchet, Francesco De Comité:
A Gap Between Linear and Non Linear Term-Rewriting Systems (1). RTA 1987: 95-104 - 1986
- [j8]Max Dauchet, Erick Timmerman:
Continuous Monoids and Yields of Infinite Trees. RAIRO Theor. Informatics Appl. 20(3): 251-274 (1986) - 1985
- [c7]Max Dauchet, Sophie Tison
Decidability of confluence for ground term rewriting systems. FCT 1985: 80-89 - 1984
- [c6]Max Dauchet, Erick Timmerman:
Decidability of yield's equality for infinite regular trees. Automata on Infinite Words 1984: 118-136 - 1983
- [c5]Sophie Tison
Metrical an Ordered Properties of Powerdomains. FCT 1983: 465-474 - 1982
- [j7]André Arnold, Max Dauchet:
Morphismes et Bimorphismes d'Arbres. Theor. Comput. Sci. 20: 33-93 (1982) - [c4]Gérard Comyn, Max Dauchet:
Approximations of Infinitary Objects. ICALP 1982: 116-127
1970 – 1979
- 1979
- [j6]André Arnold, Max Dauchet:
Théorie des Magmoïdes (II). RAIRO Theor. Informatics Appl. 13(2): 135-154 (1979) - [c3]Max Dauchet, Jocelyne Mongy:
Transformations de noyaux reconnaissables. FCT 1979: 92-98 - 1978
- [j5]André Arnold, Max Dauchet:
Forêts Algébriques et Homomorphismes Inverses. Inf. Control. 37(2): 182-196 (1978) - [j4]André Arnold, Max Dauchet:
Théorie des magmoïdes. RAIRO Theor. Informatics Appl. 12(3): 235-257 (1978) - [j3]André Arnold, Max Dauchet:
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. Math. Syst. Theory 12: 103-128 (1978) - [c2]André Arnold, Max Dauchet:
Sul l'inversion des morphisms d'arbres. ICALP 1978: 26-35 - 1976
- [j2]André Arnold, Max Dauchet:
Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. RAIRO Theor. Informatics Appl. 10(1): 5-28 (1976) - [j1]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) - [c1]André Arnold, Max Dauchet:
Bi-transductions de forêts. ICALP 1976: 74-86
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: