Nonterminal separation in graph grammars
From MaRDI portal
Publication:804300
DOI10.1016/0304-3975(91)90174-ZzbMATH Open0727.68059OpenAlexW2004135004MaRDI QIDQ804300FDOQ804300
Authors: 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
Recommendations
Cites Work
- On the structure of node-label-controlled graph languages
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Apex graph grammars and attribute grammars
- Graph grammars with neighbourhood-controlled embedding
- Linear graph grammars: Power and complexity
- Complexity of boundary graph languages
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Boundary graph grammars with dynamic edge relabeling
- Restrictions, extensions, and variations of NLC grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Syntactic Analysis and Operator Precedence
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- 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
- Position-restricted grammar forms and grammars
- Graph theoretic closure properties of the family of boundary NLC graph languages
- Combinatorial properties of boundary NLC graph languages
- On generators and generative capacity of EOL forms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (13)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Node replacement graph grammars with dynamic node relabeling
- On the structure of linear apex NLC graph grammars
- A Greibach normal form for context-free graph grammars
- Separation results for separated apex NLC and NCE graph languages
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- Title not available (Why is that?)
- Hypergraph languages of bounded degree
- Handle-rewriting hypergraph grammars
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Separating \(k\)-separated eNCE graph languages
- Title not available (Why is that?)
- Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars
This page was built for publication: Nonterminal separation in graph grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804300)
