Results 221 to 230 of about 29,070 (246)
Some of the next articles are maybe not open access.
2005
Two-level graph grammars (2GG) combine the concepts of (one-level) graph grammars — as defined by PRATT — and of two-level (string) grammars — as introduced by v. WIJNGAARDEN for the formal definition of ALGOL 68. 2GG's settle both the inadequacies of one-level graph grammars and of two-level string grammars, the former resulting from the lack of ...
openaire +1 more source
Two-level graph grammars (2GG) combine the concepts of (one-level) graph grammars — as defined by PRATT — and of two-level (string) grammars — as introduced by v. WIJNGAARDEN for the formal definition of ALGOL 68. 2GG's settle both the inadequacies of one-level graph grammars and of two-level string grammars, the former resulting from the lack of ...
openaire +1 more source
On polynomial time graph grammars
2006The complexity of node rewriting graph grammars is investigated, i.e. the membership problem for sets of graphs L(G) generated by directed, node and edge label controlled graph grammars G. We improve known results on the membership problem and comprise them into the following sharp characterization of the P vs.
openaire +1 more source
Graph compression using graph grammars.
2018This thesis presents work done on compressed graph representations via hyperedge replacement grammars. It comprises two main parts. Firstly the RePair compression scheme, known for strings and trees, is generalized to graphs using graph grammars. Given an object, the scheme produces a small context-free grammar generating the object (called a “straight-
openaire +2 more sources
Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1982Horst Bunke
exaly
Node-label controlled graph grammars with context conditions
International Journal of Computer Mathematics, 1984S H Von Solms
exaly
Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988
openaire +1 more source
openaire +1 more source
Formal Verification of Graph Grammars using Mathematical Induction
Electronic Notes in Theoretical Computer Science, 2009Leila Ribeiro
exaly
On the generative power of sequential and parallel programmed graph grammars
Computing (Vienna/New York), 1982Horst Bunke
exaly
Node replacement graph grammars with dynamic node relabeling
Theoretical Computer Science, 2015Changwook Kim
exaly