Abstract
We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these “quasi-alphabetic” tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–311 (1997)
Brown, P.F., Della Pietra, S.A., Della Pietra, V.J., Mercer, R.L.: The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics 19(2), 263–312 (1993)
Knight, K., Al-Onaizan, Y.: Translation with finite-state devices. In: Farwell, D., Gerber, L., Hovy, E. (eds.) Proc. of the AMTA 1998, pp. 421–437. Springer, London, UK (1998)
Irons, E.T.: A syntax directed compiler for ALGOL 60. Communications of the ACM 4(1), 51–55 (1961)
Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. 1: Parsing. Prentice Hall Professional Technical Reference, New Jersey (1972)
Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 1–24. Springer, Heidelberg (2005)
Graehl, J., Hopkins, M., Knight, K.: Extended top-down tree transducers. submitted to HLT-NAACL 2006, New York, USA (2006)
Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
Gécseg, F., Steinby, M.: Tree languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 3. Beyond Words, pp. 1–68. Springer, Heidelberg (1997)
Engelfriet, J.: Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory 9(3), 198–231 (1975)
Baker, B.S.: Composition of top-down and bottom-up tree transductions. Information and Control 41(2), 186–213 (1979)
Arnold, A., Dauchet, M.: Morphismes et bimorphismes d’arbres. Theoretical Computer Science 20, 33–93 (1982)
Takahashi, M.: Rational relations of binary trees. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol. 72, pp. 524–538. Springer, Heidelberg (1977)
Bozapalidis, S.: Alphabetic tree relations. Theoretical Computer Science 99(2), 177–211 (1992)
Steinby, M.: On certain algebraically defined tree transformations. In: Demetrovics, J., Budach, L., Salomaa, A. (eds.) Algebra, Combinatorics and Logic in Computer Science, vol. I, II (Györ 1983). Colloquia Mathematica Societatis János Bolyai, North-Holland, vol. 42, pp. 745–764 (1986)
Shieber, S.M.: Synchronous grammars as tree transducers. In: Proc. of the TAG+ 7, Vancouver, Canada (2004)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), available online http://www.grappa.univ-lille3.fr/tata
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steinby, M., Tîrnăucă, C.I. (2007). Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-76336-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76335-2
Online ISBN: 978-3-540-76336-9
eBook Packages: Computer ScienceComputer Science (R0)