On Domain and Range Tree Languages of Superlinear Deterministic Top-down Tree Transformations

  Gábor Dányi

Abstract:

  Denote by the class of superlinear deterministic top-down tree transformations, by the class of recognizable tree languages, and by the class of deterministic recognizable tree languages. In this paper we present the following results. The class 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 , it is decidable whether holds and we also present a decision procedure. Finally, we show that .

 Gyenizse Pal 1997. Május 21. Szerda 13:19:10 MET DST