Pages that link to "Item:Q1176107"

The following pages link to The string generating power of context-free hypergraph grammars (Q1176107):

Displaying 20 items.

• Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
• The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
• Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
• Trading independent for synchronized parallelism in finite copying parallel rewriting systems (Q1267708) (← links)
• The generating power of total deterministic tree transducers (Q1281500) (← links)
• Hypergraph languages of bounded degree (Q1318469) (← links)
• Monadic second-order definable graph transductions: a survey (Q1325847) (← 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)
• Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
• Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
• Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
• Independent parallelism in finite copying parallel rewriting systems (Q1960409) (← links)
• Handle-rewriting hypergraph grammars (Q2366278) (← links)
• The Pumping Lemma for Well-Nested Multiple Context-Free Languages (Q3637235) (← links)
• Concatenation of graphs (Q4645288) (← links)
• (Q4852905) (← links)
• (Q5021232) (← links)
• A Greibach normal form for context-free graph grammars (Q5204313) (← links)