Boundary graph grammars with dynamic edge relabeling
From MaRDI portal
(Redirected from Publication:909478)
Recommendations
- Edge-label controlled graph grammars
- scientific article; zbMATH DE number 4049107
- Node replacement graph grammars with dynamic node relabeling
- scientific article; zbMATH DE number 4049102
- Representing graph families with edge grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- Complexity of boundary graph languages
- On hyperedge replacement and BNLC graph grammars
- scientific article; zbMATH DE number 219258
Cites work
- A characterization of context-free string languages by directed node- label controlled graph grammars
- 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
- Characteristics of graph languages generated by edge replacement
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Combinatorial properties of boundary NLC graph languages
- 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. 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
- scientific article; zbMATH DE number 3888930 (Why is no real title available?)
- scientific article; zbMATH DE number 3819112 (Why is no real title available?)
- scientific article; zbMATH DE number 3943061 (Why is no real title available?)
- scientific article; zbMATH DE number 4049100 (Why is no real title available?)
- scientific article; zbMATH DE number 4049101 (Why is no real title available?)
- scientific article; zbMATH DE number 4049105 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3713195 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 3410623 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Linear graph grammars: Power and complexity
- Nonterminal bounded NLC graph grammars
- On sequential and parallel node-rewriting graph grammars
- On the structure of node-label-controlled graph languages
- Parallel concepts in graph theory
- Restrictions on NLC graph grammars
- Restrictions, extensions, and variations of NLC grammars
Cited in
(33)- Nonterminal bounded NLC graph grammars
- Separating \(k\)-separated eNCE graph languages
- Hypergraph languages of bounded degree
- Context-free graph languages of bounded degree are generated by apex graph grammars
- The bounded degree problem for eNCE graph grammars
- Logical description of context-free graph languages
- A hierarchy of eNCE families of graph languages
- Generating irregular partitionable data structures
- Double Greibach operator grammars
- Graph grammars according to the type of input and manipulated data: a survey
- Finite graph automata for linear and boundary graph languages
- Representing graph families with edge grammars
- Linear graph grammars: Power and complexity
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Node replacements in embedding normal form.
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Node replacement graph grammars with dynamic node relabeling
- Handle-rewriting hypergraph grammars
- Complexity of boundary graph languages
- scientific article; zbMATH DE number 17539 (Why is no real title available?)
- On the structure of linear apex NLC graph grammars
- scientific article; zbMATH DE number 1504826 (Why is no real title available?)
- The bounded degree problem for non-obstructing eNCE graph grammars
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- scientific article; zbMATH DE number 7456053 (Why is no real title available?)
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- A Greibach normal form for context-free graph grammars
- NCE graph grammars and clique-width.
- Separation results for separated apex NLC and NCE graph languages
- Exponential time analysis of confluent and boundary eNCE graph languages
- Quasi-rocking real-time pushdown automata
- Nonterminal separation in graph grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
This page was built for publication: Boundary graph grammars with dynamic edge relabeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q909478)
