Results 251 to 260 of about 614,117 (293)
Some of the next articles are maybe not open access.
1995
The classical double pushout approach to the algebraic theory of graph grammars is extended to multilevel graph representations, where parts of graphs are not visible and the information can be restored via the explicit application of productions. The notions of applicability and derivation are investigated and the compatibility of the representations ...
Francesco Parisi-Presicce +1 more
openaire +2 more sources
The classical double pushout approach to the algebraic theory of graph grammars is extended to multilevel graph representations, where parts of graphs are not visible and the information can be restored via the explicit application of productions. The notions of applicability and derivation are investigated and the compatibility of the representations ...
Francesco Parisi-Presicce +1 more
openaire +2 more sources
Structure graphs and structure graph grammars
Information Sciences, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andries Barnard +2 more
openaire +2 more sources
Transformations of graph grammars
1996The notion of multilevel graph representations, where parts of graphs are not visible and the information can be restored via the explicit application of productions, and the corresponding extension of the classical double pushout approach is generalized to the algebraic theory of graph grammars and to the rewriting of these grammars, at the global ...
openaire +1 more source
2005
Let [enum], [exp-i] and [pr-i] denote the class of recursively enumerable, typ-i expression and typ-i programmed graph languages respectively. The following hierarchy is known from [5]:
openaire +2 more sources
Let [enum], [exp-i] and [pr-i] denote the class of recursively enumerable, typ-i expression and typ-i programmed graph languages respectively. The following hierarchy is known from [5]:
openaire +2 more sources
Drawing graphs with attribute graph grammars
1996We address the problem of automatically generating layouts for graphs using graph grammars.
Gaby Zinßmeister, Carolyn McCreary
openaire +2 more sources
Integration of Graph Constraints into Graph Grammars
2018We investigate the integration of graph constraints into graph grammars and consider the filter problem: Given a graph grammar and a graph constraint, does there exist a “goal-oriented” grammar that generates all graphs of the original graph language satisfying the constraint.
Annegret Habel +2 more
openaire +1 more source
On the relation of graph grammars and graph automata
13th Annual Symposium on Switching and Automata Theory (swat 1972), 1972It is shown that a strong relationship exists between sets of graphs defined by graph (walking) automata with markers available and sets defined by graph grammars. Polynomial recognition algorithms are presented for certain classes of sets and it is argued that the existence of polynomial algorithms for other classes is doubtful.
openaire +2 more sources
A temporal graph grammar formalism
Journal of Visual Languages & Computing, 2018Abstract As a useful formalism tool, graph grammars provide a rigorous but intuitive way to specify visual languages. This paper, based on the existing Edge-based Graph Grammar (EGG), proposes a new context-sensitive graph grammar formalism called the Temporal Edge-based Graph Grammar, or TEGG.
Zhan Shi +6 more
openaire +2 more sources
Parallel Composition of Graph Grammars
Applied Categorical Structures, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Graph grammars based on node rewriting: an introduction to NLC graph grammars
2005An elementary introduction to the notion of an NLC graph grammar is given, and several of its extensions and variations are discussed in a systematic way. Simple concepts are considered rather than technical details.
Joost Engelfriet, Grzegorz Rozenberg
openaire +1 more source