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):
Displaying 16 items.
- (Q4037292) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- A category-theoretical approach to vertex replacement: The generation of infinite graphs (Q4645266) (← links)
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting (Q4645289) (← links)
- Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence (Q4645290) (← links)
- Drawing graphs with attribute graph grammars (Q4645294) (← links)
- (Q4852905) (← links)
- Context-free hypergraph grammars with node rewriting (Q4923541) (← links)
- Hyperedge replacement with rendezvous (Q5044734) (← links)
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770) (← links)
- Decision problems for edge grammars (Q5096886) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)
- Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)
- The monadic second-order logic of graphs : Definable sets of finite graphs (Q6203539) (← links)
- Node rewriting in hypergraphs (Q6550530) (← links)