Decidability of the Finiteness of Ranges of Tree Transductions (1996)
| Venue: | Inform. and Comput |
| Citations: | 15 - 7 self |
BibTeX
@ARTICLE{Drewes96decidabilityof,
author = {Frank Drewes and Joost Engelfriet},
title = {Decidability of the Finiteness of Ranges of Tree Transductions},
journal = {Inform. and Comput},
year = {1996},
volume = {145},
pages = {1--50}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1 Introduction The finiteness problem is one of the classical decidability problems in formal language theory. For a given language of interest, one usually does not wish to know whether that language is finite (because it usually is not), but rather whether the l...
