Pages that link to "Item:Q5637894"

The following pages link to Linear and Context-Free Graph Grammars (Q5637894):

Displaying 20 items.

• A structural/temporal query language for business processes (Q414923) (← links)
• Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery (Q1095944) (← links)
• On the generative power of sequential and parallel programmed graph grammars (Q1163378) (← links)
• The string generating power of context-free hypergraph grammars (Q1176107) (← links)
• Mosaic grammars (Q1222515) (← links)
• Network languages for complex systems (Q1309716) (← links)
• A linguistic approach to geometric reasoning (Q1309724) (← links)
• Translations of network languages (Q1324385) (← links)
• A pumping lemma and the structure of derivations in the boundary NLC graph languages (Q1328510) (← links)
• The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
• Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
• Linear graph grammars: Power and complexity (Q1825679) (← links)
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars (Q2117263) (← links)
• The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
• Syntactic/semantic techniques in pattern recognition: A survey (Q3967075) (← links)
• An algorithm for the inference of tree grammars (Q4185827) (← links)
• String and graph grammar characterizations of bounded regular languages (Q4194489) (← links)
• Using attributed flow graph parsing to recognize clichés in programs (Q4645274) (← links)
• Hyperedge replacement with rendezvous (Q5044734) (← links)