Pages that link to "Item:Q2277851"
From MaRDI portal
The following pages link to The complexity of graph languages generated by hyperedge replacement (Q2277851):
Displaying 14 items.
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Probabilistic hyperedge replacement grammars (Q1351216) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars (Q2117263) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- Uniform parsing for hyperedge replacement grammars (Q2656168) (← links)
- Predictive Top-Down Parsing for Hyperedge Replacement Grammars (Q2947208) (← links)
