Results 271 to 280 of about 10,154 (303)
Some of the next articles are maybe not open access.
Parallel Composition of Graph Grammars
Applied Categorical Structures, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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 +1 more source
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 +1 more source
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
A comparison of reserved graph grammar and edge-based graph grammar
The Computer JournalAbstract 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, 1998Summary: 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
Towards distributed graph grammars
1987Concepts 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 +3 more
openaire +1 more source
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
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
Graph grammars and diagram editing
1987This 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