Comparison of tree transductions defined by monadic second order logic and by attribute grammars

Journal of Computer and System Sciences

Volumn 61, Issue 1, 2000, Pages 1-50

  Bloem, Roderick ^a   Engelfriet, Joost ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; DATA STRUCTURES; MATHEMATICAL MODELS; TREES (MATHEMATICS);

ATTRIBUTE GRAMMARS; MONADIC SECOND ORDER LOGICS; TREE TRANSDUCTIONS;

FORMAL LOGIC;

EID: 0034247087     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1684     Document Type: Article

References (52)

1. Aho A. V., Ullman J. D. Translations on a context-free grammar. Inform. and Control. 19:1971;439-475.
2. Arnborg S., Lagergren J., Seese D. Easy problems for tree-decomposable graphs. J. Algorithms. 12:1991;308-340.
3. Bloem R. Attribute Grammars and Monadic Second Order Logic. June 1996;Leiden University.
4. Bloem R., Engelfriet J. Monadic second order logic and node relations on graphs and trees. Mycielski J., Rozenberg G., Salomaa A. Structures in Logic and Computer Science. Lecture Notes in Computer Science. 1261:1997;144-161 Springer-Verlag, Berlin.
5. Boyland J. T. Conditional attribute grammars. ACM Trans. Program. Languages Systems. 18:1996;73-108.
6. Büchi J. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlag. Math. 6:1960;66-92.
7. Corradini A., Montanari U. Proc. SEGRAGRA'95, Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation. Electronic Notes in Theoretical Computer Science. 2:1995;Elsevier, Amsterdam.
8. Courcelle B. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Inform. and Comput. 85:1990;12-75.
9. Courcelle B. Graph rewriting: an algebraic and logic approach. van Leeuwen J. Handbook of Theoretical Computer Science. 1990;193-242 Elsevier, Amsterdam.
10. Courcelle B. The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theoret. Comput. Sci. 80:1991;153-202.
11. Courcelle B. Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci. 126:1994;53-75.
12. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1, Foundations. 1997;World Scientific, Singapore.
13. Courcelle B., Engelfriet J. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Math. Systems Theory. 28:1995;515-552.
14. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. Systems Sci. 46:1993;218-270.
15. Courcelle B., Franchi-Zannettacci P. Attribute grammars and recursive program schemes I, II. Theoret. Comput. Sci. 17:1982;163-191.
16. Courcelle B., Mosbah M. Monadic second-order evaluations on tree decomposable graphs. Theoret. Comput. Sci. 109:1993;49-82.
17. Deransart P., Jourdan M., Lorho B. Attribute Grammars. Lecture Notes in Computer Science. 323:1988;Springer-Verlag, Berlin.
18. Doner J. Tree acceptors and some of their applications. J. Comput. Systems Sci. 4:1970;406-451.
19. Drewes F., Habel A., Kreowski H.-J. Hyperedge replacement graph grammars. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1 Foundations. 1997;World Scientific, Singapore.
20. Elgot C. C. Decision problems of finite automata and related arithmetics. Trans. Amer. Math. Soc. 98:1961;21-51.
21. Engelfriet J. Top-down tree transducers with regular look-ahead. Math. Systems Theory. 10:1977;289-303.
22. Engelfriet J. Tree transducers and syntax-directed semantics. 1981;Twente University of Technology.
23. Engelfriet J. Attribute grammars: attribute evaluation methods. Lorho B. Methods and Tools for Compiler Construction. 1984;103-138 Cambridge University Press, Cambridge.
24. Engelfriet J. A characterization of context-free NCE graph languages by monadic second-order logic on trees. Ehrig H., Kreowski H.-J., Rozenberg G. Graph Grammars and their Application to Computer Science. Lecture Notes in Computer Science. 532:1991;311-327 Springer-Verlag, Berlin.
25. Engelfriet J. A regular characterization of graph languages definable in monadic second-order logic. Theoret. Comput. Sci. 88:1991;139-150.
26. Engelfriet J. Context-free graph grammars. Rozenberg G., Salomaa A. Handbook of Formal Languages, Vol. 3: Beyond Words. 1997;Springer-Verlag, Berlin.
27. Engelfriet J., Filè G. The formal power of one-visit attribute grammars. Acta Inform. 16:1981;275-302.
28. Engelfriet J., Heyker L. M. Context-free hypergraph grammars have the same term-generating power as attribute grammars. Acta Inform. 29:1992;161-210.
29. Engelfriet J., Maneth S. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput. 154:1999;34-91.
30. Engelfriet J., van Oostrom V. Logical description of context-free graph languages. J. Comput. Systems Sci. 55:1997;489-503.
31. Engelfriet J., Rozenberg G. Node replacement graph grammars. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. 1997;World Scientific, Singapore.
32. Engelfriet J., Rozenberg G., Slutzki G. Tree transducers, L systems, and two-way machines. J. Comput. Systems Sci. 20:1980;150-202.
33. Engelfriet J., Vogler H. Macro tree transducers. J. Comput. Systems Sci. 31:1985;74-146.
34. Fülöp Z., Herrmann F., Vágvölgyi S., Vogler H. Tree transducers with external functions. Theoret. Comput. Sci. 108:1993;185-236.
35. Fülöp Z. On attributed tree transducers. Acta Cybernet. 5:1981;261-279.
36. Fülöp Z., Vágvölgyi S. Attributed tree transducers cannot induce all deterministic bottom-up tree transformations. Inform. and Comput. 116:1995;231-240.
37. Fülöp Z., Vogler H. Syntax-Directed Semantics. Formal Models Based on Tree Transducers. EATCS Monograph in Theoretical Computer Science. 1998;Springer-Verlag, Berlin.
38. Ganzinger H. Increasing modularity and language-independency in automatically generated compilers. Sci. Comput. Programming. 3:1983;223-278.
39. Ganzinger H., Giegerich R. Attribute coupled grammars. Proc. SIGPLAN'84. SIGPLAN Notices. 19:1984;. p. 157-170.
40. Gécseg F., Steinby M. Tree Automata. 1984;Akadémiai Kiadó Budapest.
41. Giegerich R. Composition and evaluation of attribute coupled grammars. Acta Inform. 25:1988;355-423.
42. Kamimura T., Slutzki G. Parallel and two-way automata on directed ordered acyclic graphs. Inform. and Control. 49:1981;10-51.
43. N. Klarlund and M. L. Schwartzbach, Graph types, in Proc. of the 20th Conference on Principles of Programming Languages (POPL), 1993, pp. 196-205.
44. Knuth D. E. Semantics of context-free languages. Math. Systems Theory. 2:1968;127-145.
45. Kühnemann A., Vogler H. Synthesized and inherited functions, a new computational model for syntax-directed semantics. Acta Inform. 31:1994;431-477.
46. Kühnemann A., Vogler H. Attributgrammatiken. 1997;Vieweg, Braunschweig.
47. Mezei J., Wright J. B. Algebraic automata and context-free sets. Inform. and Control. 11:1967;3-29.
48. Neven F., Van den Bussche J. Expressiveness of structured document query languages based on attribute grammars. Proc. of the 17the ACM Symposium on Principles of Databases Systems (PODS). 1998;Assoc. Comput. Mach. New York. p. 11-17.
49. van Oostrom V. Graph Grammars and 2nd Order Logic. January 1989;Leiden University.
50. Sleep M. R., Plasmeijer M. J., van Eekelen M. C. J. D. Term Graph Rewriting-Theory and Practice. 1993;John Wiley, London.
51. Thatcher J. W., Wright J. B. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory. 2:1968;57-81.
52. Thomas W. Automata on infinite objects. van Leeuwen J. Handbook of Theoretical Computer Science. 1990;133-192 Elsevier, Amsterdam.