Results 271 to 280 of about 2,840 (305)

Parallel Composition of Graph Grammars

Applied Categorical Structures, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Graph grammars based on node rewriting: an introduction to NLC graph grammars

2005
An 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

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

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

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

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

Two-level graph grammars

2005
Two-level graph grammars (2GG) combine the concepts of (one-level) graph grammars — as defined by PRATT — and of two-level (string) grammars — as introduced by v. WIJNGAARDEN for the formal definition of ALGOL 68. 2GG's settle both the inadequacies of one-level graph grammars and of two-level string grammars, the former resulting from the lack of ...
openaire   +1 more source

A New Class of Graph Grammars and Modelling of Certain Biological Structures

Symmetry, 2023
Ak Nagar, Lisa Mathew, Jayakrishna V
exaly  

Graph grammars

1977
H. J. Schneider, null Erlangen
openaire   +1 more source

Graph grammars and diagram editing

1987
This paper reports on an ongoing work which started in 1981 and is aiming at developing a general, computer-aided method which would help to considerably reduce the time necessary to develop a syntax-directed editor for any given diagram technique.
openaire   +1 more source