On hyperedge replacement and BNLC graph grammars
From MaRDI portal
Publication:1308742
DOI10.1016/0166-218X(93)90106-XzbMath0789.68087MaRDI QIDQ1308742
Publication date: 10 December 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Related Items (3)
A uniform approach to graph rewriting: The pullback approach ⋮ Node rewriting in graphs and hypergraphs: A categorical framework ⋮ A partial k-arboretum of graphs with bounded treewidth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperedge replacement: grammars and languages
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Restrictions on NLC graph grammars
- Graph theoretic closure properties of the family of boundary NLC graph languages
- Combinatorial properties of boundary NLC graph languages
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Characteristics of graph languages generated by edge replacement
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
- Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Graph expressions and graph rewritings
This page was built for publication: On hyperedge replacement and BNLC graph grammars
