Some structural aspects of hypergraph languages generated by hyperedge replacement
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Journal of Symbolic Computation
High level tree transducers and iterated pushdown tree transducers
Acta Informatica
Top-down tree transducers with deterministic top-down look-ahead
Information Processing Letters
The complexity of graph languages generated by hyperedge replacement
Acta Informatica
A comparison of boundary graph grammars and context-free hypergraph grammars
Information and Computation
The string generating power of context-free hypergraph grammars
Journal of Computer and System Sciences
Proving termination with multiset orderings
Communications of the ACM
A syntax directed compiler for ALGOL 60
Communications of the ACM
Context-Free Controlled ETOL Systems
Proceedings of the 10th Colloquium on Automata, Languages and Programming
On context-free sets of graphs and their monadic second-order theory
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
May we introduce to you: hyperedge replacement
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Decomposition Trees: Structured Graph Representation and Efficient Algorithms
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
Automatic generation of efficient evaluators for attribute grammars
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Generalized2 sequential machine maps
Journal of Computer and System Sciences
Output string languages of compositions of deterministic macro tree transducers
Journal of Computer and System Sciences
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Multi-Return Macro Tree Transducers
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Using tree transducers for grammatical inference
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Hi-index | 0.00 |
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such transducers are very similar to the usual (total deterministic) top-down tree transducers except that the right-hand sides of their rules are hypergraphs rather than trees. Since we are aiming at a device which also allows us to translate trees into objects different from graphs, we focus our attention on so-called tree-generating top-down tree-to-graph transducers. Then the result of every computation is a hypergraph which represents a tree, and in its turn the tree can be interpreted in any algebra of appropriate signature. Although for both devices, top-down tree transducers and tree-generating top-down tree-to-graph transducers, the translation of a subtree of an input tree does not depend on its context, the latter trans-ducers have much more transformational power than the former. In this paper we prove that tree-generating top-down tree-to-graph transducers are equivalent to (total deterministic) macro tree transducers, which are transducers for which the translation of a subtree may depend upon its context. We also prove that tree-generating top-down tree-to-graph transducers are closed under regular look-ahead.