Pages that link to "Item:Q1089809"

The following pages link to String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809):

Displaying 11 items.

• On the structure of linear apex NLC graph grammars (Q441855) (← links)
• Contextual hyperedge replacement (Q493120) (← links)
• Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
• The complexity of regular DNLC graph languages (Q909473) (← links)
• NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328) (← links)
• A hierarchy of eNCE families of graph languages (Q1389767) (← 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)
• Uniform parsing for hyperedge replacement grammars (Q2656168) (← links)
• Graph Parsing as Graph Transformation (Q5100735) (← links)
• Graph Transformations (Q5292608) (← links)