Macro tree translations of linear size increase are MSO definable

SIAM Journal on Computing

Volumn 32, Issue 4, 2003, Pages 950-1006

  Engelfriet, Joost ^a   Maneth, Sebastian ^a,b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b EPFL   (Switzerland)

Author keywords

Decidability; Monadic second order logic; Tree transducers

Indexed keywords

FORMAL LOGIC; SOFTWARE PROTOTYPING; TREES (MATHEMATICS);

TREE TRANSDUCERS;

COMPUTER AIDED LANGUAGE TRANSLATION;

EID: 0141534109     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701394511     Document Type: Article

References (53)

1. A. V. AHO AND J. D. ULLMAN, Translations on a context-free grammar, Inform, and Control, 19 (1971), pp. 439-475.
2. G. J. BEX, S. MANETH, AND F. NEVEN, A formal model for an expressive fragment of XSLT, Inform. Systems, 27 (2002), pp. 21-39.
3. R. BLOEM AND J. ENGELFRIET, A comparison of tree transactions defined by monadic second order logic and by attribute grammars, J. Comput. System Sci., 61 (2000), pp. 1-50.
4. B. COURCELLE, Fundamental properties of infinite trees, Theoret. Comput. Sci., 25 (1983), pp. 95-169.
5. B. COURCELLE, Monadic second-order definable graph transductions: A survey, Theoret. Comput. Sci., 126 (1994), pp. 53-75.
6. B. COURCELLE, Structural properties of context-free sets of graphs generated by vertex replacement, Inform, and Comput., 116 (1995), pp. 275-293.
7. B. COURCELLE AND J. ENGELFRIET, A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars, Math. Systems Theory, 28 (1995), pp. 515-552.
8. B. COURCELLE AND P. FRANCHI-ZANNETTACCI, Attribute grammars and recursive program schemes. I, Theoret. Comput. Sci., 17 (1982), pp. 163-191.
9. B. COURCELLE AND P. FRANCHI-ZANNETTACCI, Attribute grammars and recursive program schemes. II, Theoret. Comput. Sci., 17 (1982), pp. 235-257.
10. F. DREWES, A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars, Theory Comput. Systems, 32 (1999), pp. 159-208.
11. F. DREWES, The complexity of the exponential output size problem for top-down and bottom-up tree transducers, Inform, and Comput., 169 (2001), pp. 264-283.
12. F. DREWES AND J. ENGELFRIET, Decidability of finiteness of ranges of tree transductions, Inform, and Comput., 145 (1998), pp. 1-50.
13. H.-D. EBBINGHAUS AND J. FLUM, Finite Model Theory, Springer-Verlag, Berlin, 1995.
14. J. ENGELFRIET, Top-down tree transducers with regular look-ahead, Math. Systems Theory, 10 (1977), pp. 289-303.
15. J. ENGELFRIET, Some open questions and recent results on tree transducers and tree languages, in Formal Language Theory: Perspectives and Open Problems, R. Book, ed., Academic Press, New York, 1980, pp. 241-286.
16. J. ENGELFRIET, Context-free graph grammars, in Handbook of Formal Languages, Volume 3, G. Rozenberg and A. Salomaa, eds., Springer-Verlag, Berlin, 1997, pp. 125-213.
17. J. ENGELFRIET AND G. FILÈ, The formal power of one-visit attribute grammars, Acta Inform., 16 (1981), pp. 275-302.
18. J. ENGELFRIET AND H. J. HOOGEBOOM, MSO definable string transductions and two-way finite-state transducers, ACM Trans. Comput. Log., 2 (2001), pp. 216-254.
19. J. ENGELFRIET AND S. MANETH, Macro tree transducers, attribute grammars, and MSO definable tree translations, Inform. and Comput., 154 (1999), pp. 34-91.
20. J. ENGELFRIET AND S. MANETH, Tree languages generated by context-free graph grammars, in Proceedings of the 6th International Workshop on Theory and Application of Graph Transformations (TAGT'98), H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, eds., Lecture Notes in Comput. Sci. 1764, Springer-Verlag, New York, 2000, pp. 15-29.
21. J. ENGELFRIET AND S. MANETH, A comparison of pebble tree transducers with macro tree transducers, Acta Inform., to appear.
22. J. ENGELFRIET, G. ROZENBERG, AND G. SLUTZKI, Tree transducers, L systems, and two-way machines, J. Comput. System Sci., 20 (1980), pp. 150-202.
23. J. ENGELFRIET AND V. VAN OOSTROM, Logical description of context-free graph languages, J. Comput. System Sci., 55 (1997), pp. 489-503.
24. J. ENGELFRIET AND H. VOGLER, Macro tree transducers, J. Comput. System Sci., 31 (1985), pp. 71-146.
25. J. ENGELFRIET AND H. VOGLER, High level tree transducers and iterated pushdown tree transducers, Acta Inform., 26 (1988), pp. 131-192.
26. J. ENGELFRIET AND H. VOGLER, The translation power of top-down tree-to-graph transducers, J. Comput. System Sci., 49 (1994), pp. 258-305.
27. Z. FÜLÖP, On attributed tree transducers, Acta Cybernet., 5 (1981), pp. 261-279.
28. Z. FÜLÖP AND H. VOGLER, Syntax-Directed Semantics - Formal Models based on Tree Transducers, Monogr. Theoret. Comput. Sci. EATCS Ser., W. Brauer, G. Rozenberg, and A. Salomaa, eds., Springer-Verlag, Berlin, 1998.
29. Z. FÜLÖP AND H. VOGLER, A characterization of attributed tree transformations by a subclass of macro tree transducers, Theory Comput. Systems, 32 (1999), pp. 649-676.
30. H. GANZINGER, Increasing modularity and language-independency in automatically generated compilers, Sci. Comput. Programming, 3 (1983), pp. 223-278.
31. F. GÉCSEG AND M. STEINBY, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
32. F. GÉCSEG AND M. STEINBY, Tree automata, in Handbook of Formal Languages, Volume 3, G. Rozenberg and A. Salomaa, eds., Springer-Verlag, Berlin, 1997, pp. 1-68.
33. R. GIEGERICH, Composition and evaluation of attribute coupled grammars, Acta Inform., 25 (1988), pp. 355-423.
34. N. IMMERMAN, Descriptive Complexity, Springer-Verlag, New York, 1999.
35. E. IRONS, A syntax directed compiler for ALGOL 60, Comm. ACM, 4 (1961), pp. 51-55.
36. N. KLARLUND AND M. I. SCHWARTZBACH, Graphs and decidable transductions based on edge constraints, in Proceedings of the 19th Colloquium on Trees in Algebra and Programming - CAAP 94, S. Tison, ed., Lecture Notes in Comput. Sci. 787, Springer-Verlag, New York, 1994, pp. 187-201.
37. D. KNUTH, Semantics of context-free languages, Math. Systems Theory, 2 (1968), pp. 127-145. (Corrections in Math. Systems Theory, 5 (1971), pp. 95-96.)
38. H.-P. KOLB, J. MICHAELIS, U. MÖNNICH, AND F. MORAWIETZ, An operational and denotational approach to non-context-freeness, Theoret. Comput. Sci., to appear.
39. A. KÜHNEMANN, Benefits of tree transducers for optimizing functional programs, in Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS' 98), V. Arvind and R. Ramanujam, eds., Lecture Notes in Comput. Sci. 1530, Springer-Verlag, New York, 1998, pp. 146-157.
40. A. KÜHNEMANN AND H. VOGLER, Attributgrammatiken, Vieweg-Verlag, Braunschweig, Wiesbaden, Germany, 1997.
41. A. KÜHNEMANN AND J. VOIGTLÄNDER, Tree Transducer Composition as Deforestation Method for Functional Programs, Tech. Report TUD-FI01-07, Department of Computer Science, Technical University of Dresden, 2001.
42. S. MANETH, The complexity of compositions of deterministic tree transducers, in Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), M. Agrawal and A. Seth, eds., Lecture Notes in Comput. Sci. 2556, Springer-Verlag, New York, 2002, pp. 265-276.
43. S. MANETH AND F. NEVEN, Recursive structured document transformations, in Research Issues in Structured and Semistructured Database Programming - Revised Papers DBPL'99, R. Connor and A. Mendelzon, eds., Lecture Notes in Comput. Sci. 1949, Springer-Verlag, New York, 2000, pp. 80-98.
44. J. MICHAELIS, U. MÖNNICH, AND F. MORAWIETZ, On minimalist attribute grammars and macro tree transducers, in Linguistic Form and Its Computation, C. Rohrer, A. Rossdeutscher, and H. Kamp, eds., CSLI Publications, Stanford, CA, 2001, pp. 287-326.
45. T. MILO, D. SUCIU, AND V. VIANU, Typechecking for XML transformers, in Proceedings of the 19th ACM Symposium on Principles of Database Systems (PODS'2000), ACM, New York, 2000, pp. 11-22.
46. W. ROUNDS, Mappings and grammars on trees, Math. Systems Theory, 4 (1970), pp. 257-287.
47. J. STOY, Denotational Semantics, MIT Press, Cambridge, MA, 1977.
48. 2 sequential machine maps, J. Comput. System Sci., 4 (1970), pp. 339-367.
49. A. VAN DEURSEN, J. HEERING, AND P. KLINT, EDS., Language Prototyping, AMAST Series in Computing 5, World Scientific, River Edge, NJ, 1996.
50. A. VAN DEURSEN, P. KLINT, AND F. TIP, Origin tracking and its applications, in Language Prototyping, World Scientific, River Edge, NJ, 1996, pp. 249-294.
51. V. VIANU, A web odyssey: From Codd to XML, in Proceedings of the 20th ACM Symposium on Principles of Database Systems (PODS'2001), ACM, New York, 2001, pp. 1-15.
52. H. VOGLER, Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers, Sci. Comput. Programming, 16 (1991), pp. 251-275.
53. R. WILHELM AND D. MAURER, Compiler Design, Addison-Wesley, Reading, MA, 1995.