Pages that link to "Item:Q684560"
From MaRDI portal
The following pages link to Hyperedge replacement: grammars and languages (Q684560):
Displaying 50 items.
- On cylindrical graph construction and its applications (Q252833) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Contextual hyperedge replacement (Q493120) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Generating self-affine fractals by collage grammars (Q673096) (← links)
- On the regular structure of prefix rewriting (Q685354) (← links)
- Algebraic approach to single-pushout graph transformation (Q685460) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- Categorical principles, techniques and results for high-level-replacement systems in computer science (Q690375) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Introduction to graph grammars with applications to semantic networks (Q918717) (← links)
- Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
- Adaptive star grammars and their languages (Q986544) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- The generating power of total deterministic tree transducers (Q1281500) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Probabilistic hyperedge replacement grammars (Q1351216) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Parallel high-level replacement systems (Q1389763) (← links)
- Criteria to disprove context freeness of collage languages. (Q1401171) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Hierarchical graph transformation (Q1608318) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- P systems with local graph productions (Q1762940) (← links)
- A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars (Q2117263) (← links)
- Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete (Q2232268) (← links)
- Language theoretic properties of regular DAG languages (Q2272978) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
