Results 261 to 270 of about 2,840 (305)

On labelled graph grammars

Computing, 1978
According to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages.
Leon S. Levy, Kang Yueh
openaire   +2 more sources

On structured graph grammars. II

Information Sciences, 1990
One starts by identifying the steps generally followed when applying a rule r to a graph M in a graph grammar; then one formalizes these steps, obtaining a model called structured graph grammar. Various examples, illustrating this approach, are discussed (binary trees, pretty patterns, syntax diagrams) and many previous approaches to graph grammars are
Hans-Jörg Kreowski, Grzegorz Rozenberg
openaire   +3 more sources

Multilevel graph grammars

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, Gabriele Piersanti   +1 more
openaire   +1 more source

Structure graphs and structure graph grammars

Information Sciences, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andries Barnard, E. M. Ehlers, Johannes H. Hattingh   +2 more
openaire   +1 more source

Transformations of graph grammars

1996
The 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

Programmed graph grammars

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   +1 more source

Drawing graphs with attribute graph grammars

1996
We address the problem of automatically generating layouts for graphs using graph grammars.
Gaby Zinßmeister, Carolyn McCreary
openaire   +1 more source

On the relation of graph grammars and graph automata

13th Annual Symposium on Switching and Automata Theory (swat 1972), 1972
It 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   +1 more source

Integration of Graph Constraints into Graph Grammars

2018
We 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, Christian Sandmann, Tilman Teusch   +2 more
openaire   +1 more source

Parsing Spatial Graph Grammars

2004 IEEE Symposium on Visual Languages - Human Centric Computing, 2005
This paper presents a parser for a spatial graph grammar formalism, which integrates both the spatial and structural specification mechanisms in a single framework. By taking advantage of the spatial information, the parser performs in polynomial time with an improved parsing complexity over its non-spatial predecessor, i.e.
Jun Kong, Kang Zhang 0001
openaire   +1 more source