Pages that link to "Item:Q3747744"
From MaRDI portal
The following pages link to Boundary NLC graph grammars—Basic definitions, normal forms, and complexity (Q3747744):
Displaying 49 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- On structured graph grammars. I (Q753498) (← links)
- Nonterminal separation in graph grammars (Q804300) (← links)
- Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← 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)
- On the membership problem for regular DNLC grammars (Q1082088) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← links)
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- Algorithms for graph problems on BNLC structured garphs (Q1175948) (← 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)
- 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)
- A pumping lemma and the structure of derivations in the boundary NLC graph languages (Q1328510) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- A hierarchy of eNCE families of graph languages (Q1389767) (← links)
- Double Greibach operator grammars (Q1589438) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← 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)
- On the regularity and learnability of ordered DAG languages (Q2399247) (← links)
- Equational Reasoning with Context-Free Families of String Diagrams (Q2947216) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- Graph automata for linear graph languages (Q4645286) (← links)
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting (Q4645289) (← links)
- (Q4852905) (← links)
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770) (← links)
- On the structure of recognizable languages of dependence graphs (Q5286052) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)
- Learning of restricted RNLC graph languages (Q6487959) (← links)
