HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3885330 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- A comparison of boundary graph grammars and context-free hypergraph grammars
- A hierarchy of eNCE families of graph languages
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Apex graph grammars and attribute grammars
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Boundary graph grammars with dynamic edge relabeling
- Combinatorial properties of boundary NLC graph languages
- Complexity of boundary graph languages
- Decision problems for node label controlled graph grammars
- Edge-label controlled graph grammars
- Graph expressions and graph rewritings
- Graph grammars and their application to computer science. 5th international workshop, Williamsburg, VA, USA, November 13--18, 1994. Selected papers
- Graph grammars with neighbourhood-controlled embedding
- Graph theoretic closure properties of the family of boundary NLC graph languages
- 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
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Handle NLC grammars and r. e. languages
- Handle-rewriting hypergraph grammars
- Hypergraph languages of bounded degree
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Linear graph grammars: Power and complexity
- Metatheorems for decision problems on hyperedge replacement graph languages
- Neighborhood-uniform NLC grammars
- Node replacement graph languages squeezed with chains, trees, and forests
- Nonterminal separation in graph grammars
- On the Tape Complexity of Deterministic Context-Free Languages
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Separating \(k\)-separated eNCE graph languages
- The NP-completeness column: An ongoing guide
- The complexity of graph languages generated by hyperedge replacement
- The complexity of regular DNLC graph languages
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
Cited in
(6)- Powerful and NP-complete: hypergraph Lambek grammars
- scientific article; zbMATH DE number 177438 (Why is no real title available?)
- Double Greibach operator grammars
- Node replacement graph grammars with dynamic node relabeling
- Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
- Separation results for separated apex NLC and NCE graph languages
This page was built for publication: HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960412)
