Résultats obtenus sur les Transducteurs lettre à lettre d'arbres

• FCT'93 : Fundamentals of Computer Theory. Szeged (Hungary), 1993

Decidability of Equivalence for linear letter-to-letter top-down tree transducers[.ps]
Lecture Notes in Computer Science, Vol. 710, pp 142-151.
Yves ANDRE, Francis BOSSUT.

• RAIRO 94 : Theoretical Informatics and Applications, 1994

Decidability of Equivalence for a class of non-deterministic tree transducers.[.ps]
Rairo, vol 28, # 5, pp 447-463.
Yves ANDRE, Max DAUCHET.
 
• CAAP'95 : Colloquium on Tree in Algebra and Programming. Aarhus (Denmark), 1995

The Equivalence Problem for letter-to-letter bottom-up tree transducers is solvable.[.ps]
Lecture Notes in Computer Science, Vol. 915, pp 155-171.
Yves ANDRE, Francis BOSSUT.
 
• CAAP'97 : Colloquium on Tree in Algebra and Programming. Lille (France), 1997

Word into tree Transducers with Bounded Difference.[.ps]
Lecture Notes in Computer Science, Vol. 915, pp 155-171.
Yves ANDRE, Francis BOSSUT.
 
• TCS 98  : Theoretical Computer Science, 1998

On The Equivalence Problem for letter-to-letter top-down tree transducers.[.ps]
TCS 205, pp 207-229.
Yves ANDRE, Francis BOSSUT.