A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Denote by sl-DT the class of superlinear deterministic top-down tree transformations, by REC the class of recognizable tree languages, and by DREC the class of deterministic recognizable tree languages. In this paper we present the following results. The class dom(sl-DT) is exactly the class of tree languages recognized by semi-universal deterministic top-down tree recognizers, which are introduced in this paper. Moreover, for any L € DREC, it is decidable whether L £ doni(sl-DT) holds and wedblp:journals/actaC/Danyi96 fatcat:exmjg3yfgnfmpd4y2ojl6uhmcu