The equivalence of bottom-up and top-down tree-to-graph transducers
From MaRDI portal
Publication:1271618
DOI10.1006/jcss.1998.1573zbMath1034.68526OpenAlexW2058885731MaRDI QIDQ1271618
Heiko Vogler, Joost Engelfriet
Publication date: 24 November 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/04569b0e1415167bb67a725f6e52191eb64ab4ed
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead ⋮ Transduction from trees to graphs through folding ⋮ GETGRATS ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ Linear deterministic multi bottom-up tree transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperedge replacement: grammars and languages
- Modular tree transducers
- Tree pushdown automata
- Macro tree transducers
- Pushdown machines for the macro tree transducer
- High level tree transducers and iterated pushdown tree transducers
- Composition and evaluation of attribute coupled grammars
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Tree transducers, L systems, and two-way machines
- The formal power of one-visit attribute grammars
- Attribute grammars and recursive program schemes. I. II
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- The translation power of top-down tree-to-graph transducers
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- Generalized sequential machine maps
- Pushdown tree automata
- Graph expressions and graph rewritings
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Composition of top-down and bottom-up tree transductions
- Handbook of Graph Grammars and Computing by Graph Transformation
- The use of tree transducers to compute translations between graph algebras
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Semantics of context-free languages
- Mappings and grammars on trees
- Translations on a context free grammar
This page was built for publication: The equivalence of bottom-up and top-down tree-to-graph transducers
