A bottom-up finite state tree transducer (FST) A is called k-valued iff for every input tree there are at most k different output trees. A is called finite-valued iff it is k-valued for some k. We show: it is decidable for every k whether or not a given FST A is k-valued, and it is decidable whether or not A is finite-valued. We give an effective characterization of all finite-valued FST's and derive a (sharp) upper bound for the valuedness provided it is finite. We decompose a finite-valued FST A into a finite number of single-valued FST's. This enables us to prove: it is decidable whether or not the translation of an FST A is included in the translation of a finite-valued FST A’.
CITATION STYLE
Seidl, H. (1990). Equivalence of finite-valued bottom-up finite state tree transducers is decidable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 431 LNCS, pp. 269–284). Springer Verlag. https://doi.org/10.1007/3-540-52590-4_54
Mendeley helps you to discover research relevant for your work.