Results 271 to 280 of about 802,028 (300)

A comparison of reserved graph grammar and edge-based graph grammar

The Computer Journal
Abstract Context-sensitive graph grammars are natural formalisms for the generation and parsing of visual programming languages. Being intuitive, rigorous, and expressive tools, they have been frequently employed in a wide range of research fields.
openaire   +2 more sources

Towards distributed graph grammars

1987
Concepts for distribution of state graphs are discussed within the framework of the algebraic theory of graph grammars. First ideas and examples are presented concerning distributed derivations and distributed graph grammars which should be useful for graph theoretical specifications of distributed systems.
Paul Boehm, Hartmut Ehrig, Udo Hummert, Michael Löwe   +3 more
openaire   +1 more source

Software specification by graph grammars

2005
The following paper demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify the changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode.
Manfred Nagl, Gregor Engels, Rupert Gall, Wilhelm Schäfer   +3 more
openaire   +1 more source

On the complexity of graph grammars

Acta Cybern., 1983
\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

Random graphs and grammars on graphs

Discrete Mathematics and Applications, 1998
Summary: Random graph grammars (a multidimensional generalization of random grammars) are defined and studied. One of the basic examples is the Markov evolution of random graphs which is closed in spirit to branching processes. We consider asymptotic growth of the number of connected components and independent cycles, local properties, the phase ...
openaire   +1 more source

Graph grammars

1977
H. J. Schneider, null Erlangen
openaire   +2 more sources

On polynomial time graph grammars

2006
The 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   +2 more sources

Graph grammar‐driven parallel partial differential equation solver

Concurrency Computation Practice and Experience, 2010
Maciej Paszynski, Robert Schaefer
exaly  

Improving the graph grammar parser of Rekers and Schürr

IET Software, 2011
Marjan Mernik, Viljan Mahnič
exaly  

Parsing a graph-grammar

Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988
openaire   +2 more sources