Pages that link to "Item:Q1228365"

The following pages link to Formal languages of labelled graphs (Q1228365):

Displaying 10 items.

• Topological grammars for data approximation (Q1001095) (← links)
• On the generative power of sequential and parallel programmed graph grammars (Q1163378) (← links)
• On labelled graph grammars (Q1245573) (← links)
• Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
• The conical methodology and the evolution of simulation model development (Q1805478) (← links)
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
• Graph traversal and graph transformation (Q1885899) (← links)
• Data complexity measured by principal graphs (Q2629455) (← links)
• Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence (Q4645290) (← links)
• Closure properties of context-free hyperedge replacement systems (Q6550538) (← links)