![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 315-339
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the equivalence problem for letter-to-letter top-down tree transducers
Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Deterministic top-down tree transducers with iterated look-ahead
Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Compositions with superlinear deterministic top-down tree transformations
Theoretical Computer Science, Vol. 194, Iss. 1, 1998-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Top-down decision tree learning as information based boosting
Theoretical Computer Science, Vol. 292, Iss. 2, 2003-01 ,pp. :