Abstract
We give a decision procedure to determine whether or not the transduction of a functional transducer can be realized by a deterministic (resp. reduced deterministic) transducer. In case this is possible we exhibit a general construction to build this transducer.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A.V. Aho, J.E. Hopcroft, J.D. Ullman: The design and analysis of computer algorithms. Addison-Wesley, 1974
J. Berstel: Transductions and Context-Free Languages. Teubner, Stuttgart, 1979
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
Chr. Ferdinand, H. Seidl, R. Wilhelm: Tree automata for code selection. In: R. Giegerich, S.L. Graham (eds): Code Generation — Concepts, Tools, Techniques. Springer, Workshops in Computing, pp. 31–50, 1992
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
C. Reutenauer: Subsequential Functions: Characterizations, Minimization, Examples. Proc. IMYCS 1990, LNCS 464, pp. 62–79
H. Seidl: Equivalence of finite-valued bottom-up finite state tree transducers is decidable. Proc. CAAP '90, LNCS 431, pp. 269–284, 1990; extended version to appear in: Math. Syst. Theory
H. Seidl: Single-valuedness of tree transducers is decidable in polynomial time. To appear in: TCS, special issue of CAAP 90
A. Weber, R. Klemm: Economy of Description for Single-valued Transducers. Preprint J.W.Goethe-Universität, Frankfurt/Main, 1991
Z. Zachar: The solvability of the equivalence problem for deterministic frontierto-root tree transducers. Acta Cybernetica 4 (1978), pp. 167–177
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seidl, H. (1993). When is a functional tree transduction deterministic?. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_69
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive