Regular Article
Decidability of the Finiteness of Ranges of Tree Transductions,☆☆

https://doi.org/10.1006/inco.1998.2715Get rights and content
Under an Elsevier user license
open archive

Abstract

The finiteness of ranges of tree transductions is shown to be decidable for TBY+, the composition closure of macro tree transductions. Furthermore, TBY+definable sets and TBY+computable relations are considered, which are obtained by viewing a tree as an expression that denotes an element of a given algebra. A sufficient condition on the considered algebra is formulated under which the finiteness problem is decidable for TBY+definable sets and for the ranges of TBY+computable relations. The obtained result applies in particular to the class of string languages that can be defined by TBY+transductions via the yield mapping. This is a large class which is proved to form a substitution-closed full AFL.

Cited by (0)

Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) through the Universities of Bremen and Leiden.

☆☆

E. R. Caianello

f1

E-mail: [email protected]

f2

E-mail: [email protected]