Pages that link to "Item:Q1337465"
From MaRDI portal
The following pages link to The translation power of top-down tree-to-graph transducers (Q1337465):
Displayed 9 items.
- The generative power of delegation networks (Q897662) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- Synthesized and inherited functions. A new computational model for syntax-directed semantics (Q1338894) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (Q2390283) (← links)
- The use of tree transducers to compute translations between graph algebras (Q4645277) (← links)