scientific article

From MaRDI portal
Publication:3666286

zbMath0517.68069MaRDI QIDQ3666286

Manfred Nagl

Publication date: 1979


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Handle-rewriting hypergraph grammarsNet processes correspond to derivation processes in graph grammarsGraph traversal and graph transformationHandle NLC grammars and r. e. languagesPower properties of NLC graph grammars with a polynomial membership problemPath-controlled graph grammars for multiresolution image processing and analysisSyntax and semantics of hybrid database languagesLogic based structure rewriting systemsConcurrent graph and term graph rewritingSpecification of graph translators with triple graph grammarsBypass strong V-structures and find an isomorphic labelled subgraph in linear timeGraph grammars, insertion Lie algebras, and quantum field theoryA characterization of context-free string languages by directed node- label controlled graph grammarsBoundary graph grammars with dynamic edge relabelingOn the generative power of sequential and parallel programmed graph grammarsIntroduction to graph grammars with applications to semantic networksGraph grammars with neighbourhood-controlled embeddingUnnamed ItemOn the interleaving semantics of transformation units — A step into GRACEProgrammed graph transformations and graph transformation units in GRACEGraph automata for linear graph languagesFifty years of graph matching, network alignment and network comparisonOn structured graph grammars. IIGraph Transformations and Model-Driven Engineering: The Merits of Manfred NaglOn structured graph grammars. ILinear graph grammars: Power and complexityNote on node-rewriting graph grammarsAn economical transformation of graph grammars