Pages that link to "Item:Q1199703"

The following pages link to Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703):

Displayed 8 items.

• The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) ‎ (← links)
• The generating power of total deterministic tree transducers (Q1281500) ‎ (← links)
• Hypergraph languages of bounded degree (Q1318469) ‎ (← links)
• The translation power of top-down tree-to-graph transducers (Q1337465) ‎ (← links)
• Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) ‎ (← links)
• Synthesized and inherited functions. A new computational model for syntax-directed semantics (Q1338894) ‎ (← links)
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) ‎ (← links)
• Handle-rewriting hypergraph grammars (Q2366278) ‎ (← links)