Abstract
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'.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Courcelle, P. Franchi-Zannettacchi: Attribute grammars and recursive program schemes, part I. TCS 17 (1982) pp. 163–191
K. Culik II and J. Karhumäki: The equivalence of finite valued transducers (on HDTOL languages) is decidable. TCS 47 (1986), pp. 71–84
J. Engelfriet: Some open questions and recent results on tree transducers and tree languages. In: Formal Language Theory, ed. by R.V. Book, Academic Press 1980, pp. 241–286
Z. Esik: Decidability results concerning tree transducers I. Acta Cybernetica 5 (1980), pp. 1–20
F. Gecseg, M. Steinby: Tree automata. Akademiai Kiado, Budapest, 1984
R. Giegerich, K. Schmal: Code selection techniques: pattern matching, tree parsing and inversion of derivors. Proc. of ESOP 1988, LNCS 300 pp. 245–268
R.L. Graham, B.L. Rothschild, J.H. Spencer: Ramsey Theory. John Wiley & Sons, 1980
W. Paul: Komplexitätstheorie. B.G. Teubner Verlag Stuttgart 1978
M. Schützenberger: Sur les relations rationelles entre monoides libres. TCS 3 (1976), pp. 243–259
H. Seidl: On the finite degree of ambiguity of finite tree automata. Acta Inf. 26 (1989), pp. 527–542
A. Weber, H. Seidl: On the degree of ambiguity of finite automata. MFCS 1986, Lect. Notes in Comp. Sci. 233, pp. 620–629
A. Weber: Über die Mehrdeutigkeit und Wertigkeit von endlichen Automaten und Transducern. Doct. Thesis Frankfurt/Main 1987
A. Weber: On the valuedness of finite transducers. Preprint 1988
A. Weber: A decomposition theorem for finite-valued transducers and an application to the equivalence problem. Proc. MFCS 1988 in: LNCS 324, pp. 552–562
A. Weber: On the lengths of values in a finite transducer. Proc. MFCS 1989 in: LNSC 379, pp. 523–533
Z. Zachar: The solvability of the equivalence problem for deterministic frontier-to-root tree transducers. Acta Cybernetica 4 (1978), pp. 167–177
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seidl, H. (1990). Equivalence of finite-valued bottom-up finite state tree transducers is decidable. In: Arnold, A. (eds) CAAP '90. CAAP 1990. Lecture Notes in Computer Science, vol 431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52590-4_54
Download citation
DOI: https://doi.org/10.1007/3-540-52590-4_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52590-5
Online ISBN: 978-3-540-47042-7
eBook Packages: Springer Book Archive