Pages that link to "Item:Q1102759"
From MaRDI portal
The following pages link to An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759):
Displayed 50 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Recursive queries and context-free graph grammars (Q753477) (← links)
- Nonterminal separation in graph grammars (Q804300) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- Edge-label controlled graph grammars (Q909484) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
- Adaptive star grammars and their languages (Q986544) (← links)
- Algorithms for graph problems on BNLC structured garphs (Q1175948) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
- Order independent NCE grammars recognized in polynomial time (Q1182091) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← 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)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← 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)
- Synthesized and inherited functions. A new computational model for syntax-directed semantics (Q1338894) (← links)
- Probabilistic hyperedge replacement grammars (Q1351216) (← links)
- Monadic second-order definable text languages (Q1361884) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Node replacement graph grammars with dynamic node relabeling (Q2342679) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- Pullback Grammars Are Context-Free (Q3540411) (← links)
- Adaptive Star Grammars for Graph Models (Q3540417) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)