Results 201 to 210 of about 29,070 (246)

Apex graph grammars

1987
Apex graph grammars are NLC-like graph grammars with the restriction that embedding edges are established between terminal nodes only. Some basic theoretical properties of these grammars are investigated.
Joost Engelfriet, George Leih, Grzegorz Rozenberg   +2 more
openaire   +1 more source

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

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

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

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

Graph grammars and logic programming

2005
In 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, MONTANARI, UGO GIOVANNI ERASMO, Rossi F, Ehrig H, Loewe M.   +4 more
openaire   +2 more sources

Parallel Communicating Graph Grammar

2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011
In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). In this paper we define parallel communicating edNCE graph grammar and parallel communicating ETPL(k)
S. Jeya Bharathi, M. Saravana Vadivu, K. Thiagarajan   +2 more
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

On the complexity of graph grammars

Acta Cybern., 2020
\textit{D. Janssens} and \textit{G. Rozenberg} [J. Comput. Syst. Sci. 22, 144- 177 (1981; Zbl 0466.68067)] define node label controlled (NLC) graph grammars and show that their parsing is as hard as the membership problem for context-sensitive languages.
openaire   +3 more sources