| Yves Andre and Max Dauchet. Decidability of equivalence for a class of nondeterministic tree transducers. RAIRO Informatique Theoretique et Applications /Theoretical Informatics and Applications, 28:447-463, 1994. |
....case. And it is decidable for: bottom up deterministic transducers (K.Zachar 1978, 12] top down deterministic transducers (Z.Esik 1979, 9] More recently, in 1990, H. Seidl showed that equivalence is decidable for finitevalued bottom up finite state transducers [11] In a recent work [3], we show that equivalence is decidable for a particular class of non deterministic tree transducers which are linear and variable preserving letter to letter transducers. Unformally, these transducers only modify the label of the nodes of the trees and for every node the order of the subtrees. In ....
Y. Andr'e and M. Dauchet. Decidability of equivalence for a class of non deterministic tree transducers. Publication IT-243 LIFL. University of Lille. 1992. Submitted to Rairo.
....problem for non deterministic letter to letter transducers. Informally, trees which appear in the rules of these transducers are reduced to one letter in the right hand side as in the left one. Here, we prove the decidability of equivalence for non deleting top down transducers. In previous works [1, 2], we obtained the decidability of equivalence for linear top down transducers by encoding the tree translations into recognizable forests. To extend this result, we need to refine the encoding procedure and moreover, in order to capture the non linearity of the investigated transducers, we ....
....i ; q i ) 1; 2] q j [ no matching rule oe(q i ) q j [ A duplication turns into an equality constraint. For the case that oe is a symbol of rank 2, we distinguish four disjoint subcases : 1. There is no rule in whose left hand side contains the symbol oe, in this case, from oe(q i ; q j )[1]; 2] q (resp. oe(q i ; q j ) 1; 2] q) rule of R we construct in R 0 the rule oe(q i ; q j ) 1] 2] q [ resp. oe(q i ; q j ) 1; 2] q [ 2. The only one rule of whose left hand side contains oe has one of the following forms oe(x; y) oe(x; y) or oe(x; y) oe(y; x) oe(q i ; q ....
[Article contains additional citation context not shown here]
Y. Andr'e and M. Dauchet. Decidability of equivalence for a class of non deterministic tree transducers. RAIRO, Theoretical Informatics and Applications, Vol 28-5, pp 447-463, 1994.
....Those investigated in this paper are composed of three basic types of tree transductions. On the one hand, there are the top down and bottom up tree transductions, whose investigation began in the seventies by Rounds and Thatcher [Rou70a, Tha70a, Tha70b, Tha73] and was continued in, e.g. [Eng75a, Eng77, Bak78b, Bak78a, Bak79, Eng82, FV89, AD94, Sei94a, SV95, DF96, GV96]. These tree transductions are defined by the use of restricted rewrite rules, processing a tree from the top down or from the bottom up, respectively. The third one of the basic types of tree transductions considered acts on input trees over a signature that consists of symbols from an underlying ....
Yves Andr'e and Max Dauchet. Decidability of equivalence for a class of nondeterministic tree transducers. RAIRO Informatique Th'eoretique et Applications/ Theoretical Informatics and Applications, 28:447--463, 1994.
No context found.
Yves Andre and Max Dauchet. Decidability of equivalence for a class of nondeterministic tree transducers. RAIRO Informatique Theoretique et Applications /Theoretical Informatics and Applications, 28:447-463, 1994.
No context found.
Yves Andre and Max Dauchet. Decidability of equivalence for a class of nondeterministic tree transducers. RAIRO Informatique Theoretique et Applications /Theoretical Informatics and Applications, 28:447-463, 1994.
No context found.
Y. Andr'e and M. Dauchet. Decidability of equivalence for a class of nondeterministic tree transducers. RAIRO, Theoretical Informatics and Applications. Vol 28, n ffi 5, 1994, pp 447-463.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC