| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437804 | Theoretical Computer Science | 2009 | 29 Pages |
Abstract
We show that it is decidable for any deterministic bottom-up tree transducer A and ground term rewrite system R, which one of the following conditions holds: (i) , (ii) , (iii) , (iv) τ(A) and are incomparable. Here τ(A) is the tree transformation induced by A, and is the congruence generated by R.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
