Pages that link to "Item:Q3830540"

The following pages link to On using context-free graph grammars for analyzing recursive definitions (Q3830540):

Displaying 10 items.

• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
• Recursively indefinite databases (Q688672) (← links)
• Recursive queries and context-free graph grammars (Q753477) (← links)
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
• (Q4037326) (← links)
• A Greibach normal form for context-free graph grammars (Q5204313) (← links)