A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars

This publication has 31 references indexed in Scilit:

• Conditional attribute grammars
  ACM Transactions on Programming Languages and Systems, 1996
• A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammars
  Theory of Computing Systems, 1995
• Monadic second-order definable graph transductions: a survey
  Theoretical Computer Science, 1994
• Handle-rewriting hypergraph grammars
  Journal of Computer and System Sciences, 1993
• The monadic second-order logic of graphs V: on closing the gap between definability and recognizability
  Theoretical Computer Science, 1991
• Easy problems for tree-decomposable graphs
  Journal of Algorithms, 1991
• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
  Information and Computation, 1990
• Attribute grammars and recursive program schemes I
  Theoretical Computer Science, 1982
• Translations on a context free grammar
  Information and Control, 1971
• Weak Second‐Order Arithmetic and Finite Automata
  Mathematical Logic Quarterly, 1960