Separating \(k\)-separated eNCE graph languages
From MaRDI portal
Publication:1314371
DOI10.1016/0304-3975(93)90290-AzbMath0801.68107MaRDI QIDQ1314371
Publication date: 29 November 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (5)
On the structure of linear apex NLC graph grammars ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ Separation results for separated apex NLC and NCE graph languages ⋮ Double Greibach operator grammars ⋮ Node replacement graph grammars with dynamic node relabeling
Cites Work
- Unnamed Item
- Nonterminal separation in graph grammars
- Boundary graph grammars with dynamic edge relabeling
- A comparison of boundary graph grammars and context-free hypergraph 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
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Apex graph grammars and attribute grammars
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Decision problems for node label controlled graph grammars
- Graph grammars with neighbourhood-controlled embedding
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- Linear graph grammars: Power and complexity
- 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
- Handle-rewriting hypergraph grammars
- Neighborhood-uniform NLC grammars
- Complexity of boundary graph languages
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Graph expressions and graph rewritings
This page was built for publication: Separating \(k\)-separated eNCE graph languages
