Results 261 to 270 of about 802,028 (300)
Some of the next articles are maybe not open access.
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
Graph grammars and logic programming
2005In this paper we investigate the relationship between the algebraic definition of graph grammars and logic programming. In particular, we show that the operational semantics of any logic program can be faithfully simulated by a particular context-free hypergraph grammar.
CORRADINI, ANDREA +4 more
openaire +2 more sources
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
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
SIAM Journal on Computing, 1974
In this paper we consider first order context-free, linear, and regular graph grammars and obtain many results similar to those for the corresponding string grammars. We obtain normal forms for context-free and regular graph grammars, simplification lemmas, and algorithms for membership, emptiness, finiteness and infiniteness.
openaire +2 more sources
In this paper we consider first order context-free, linear, and regular graph grammars and obtain many results similar to those for the corresponding string grammars. We obtain normal forms for context-free and regular graph grammars, simplification lemmas, and algorithms for membership, emptiness, finiteness and infiniteness.
openaire +2 more sources
Graph-grammars: An algebraic approach
14th Annual Symposium on Switching and Automata Theory (swat 1973), 1973The paper presents an algebraic theory of graph-grammars using homomorphisms and pushout-constructions to specify embeddings and direct derivations constructively. We consider the case of arbitrary directed graphs permitting loops and parallel edges.
Hartmut Ehrig +2 more
openaire +1 more source