Nonterminal separation in graph grammars
From MaRDI portal
Publication:804300
DOI10.1016/0304-3975(91)90174-ZzbMath0727.68059OpenAlexW2004135004MaRDI QIDQ804300
Joost Engelfriet, George Leih, Grzegorz Rozenberg
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90174-z
Related Items (9)
Handle-rewriting hypergraph grammars ⋮ Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ 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 ⋮ A Greibach normal form for context-free graph grammars ⋮ Node replacement graph grammars with dynamic node relabeling ⋮ Separating \(k\)-separated eNCE graph languages ⋮ Hypergraph languages of bounded degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 generators and generative capacity of EOL forms
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Position-restricted grammar forms and grammars
- Graph grammars with neighbourhood-controlled embedding
- 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
- Complexity of boundary graph languages
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Syntactic Analysis and Operator Precedence
This page was built for publication: Nonterminal separation in graph grammars