scientific article; zbMATH DE number 3819112
From MaRDI portal
Publication:3666286
Cited in
(28)- Net processes correspond to derivation processes in graph grammars
- Handle NLC grammars and r. e. languages
- Power properties of NLC graph grammars with a polynomial membership problem
- A characterization of context-free string languages by directed node- label controlled graph grammars
- On the generative power of sequential and parallel programmed graph grammars
- Graph grammars with neighbourhood-controlled embedding
- Linear graph grammars: Power and complexity
- Graph traversal and graph transformation
- Fifty years of graph matching, network alignment and network comparison
- On structured graph grammars. II
- Handle-rewriting hypergraph grammars
- Graph transformations and model-driven engineering: the merits of Manfred Nagl
- An economical transformation of graph grammars
- scientific article; zbMATH DE number 3808978 (Why is no real title available?)
- On the interleaving semantics of transformation units -- a step into GRACE
- Programmed graph transformations and graph transformation units in GRACE
- Graph automata for linear graph languages
- Path-controlled graph grammars for multiresolution image processing and analysis
- Syntax and semantics of hybrid database languages
- Logic based structure rewriting systems
- Concurrent graph and term graph rewriting
- Specification of graph translators with triple graph grammars
- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time
- On structured graph grammars. I
- Note on node-rewriting graph grammars
- Graph grammars, insertion Lie algebras, and quantum field theory
- Boundary graph grammars with dynamic edge relabeling
- Introduction to graph grammars with applications to semantic networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666286)