Category:LNCS 1073

From BibNetWiki

Lecture Notes in Computer Science, Volume 1073

Articles in category "LNCS 1073"

There are 38 articles in this category.

A A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs A Graph Rewriting Framework for Statecharts Semantics A Partial Algebras Approach to Graph Transformation A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths An Event Structure Semantics for Graph Grammars with Parallel Productions C Cellworks with Cell Rewriting and Cell Packing for Plant Morphogenesis Chain-Code Pictures and Collages Generated by Hyperedge Replacement Concatenation of Graphs D Drawing Graphs with Attribute Graph Grammars F Formal Relationship between Graph Grammars and Petri Nets G Graph Automata for Linear Graph Languages Graph Pattern Matching in PROGRES

G cont. Graph Unification and Matching Graph grammars and their application to computer science: 5th international workshop, Williamsburg, VA, USA, November 13-18, 1994: selected papers Group Based Graph Transformations and Hierarchical Representations of Graphs H HRNCE Grammars - A Hypergraph Generating System with an eNCE Way of Rewriting Hierarchically Distributed Graph Transformation I Integrating Lineage and Interaction for the Visualization of Cellular Structures Issues in the Practical Use of Graph Rewriting N Node Replacement in Hypergraphs: Simulation of Hyperedge Replacement, and Decidability of Confluence O On Edge Addition Rewrite Systems and their Relevance to Program Analysis On the Interleaving Semantics of Transformation Units - A Step into GRACE P Pragmatic and Semantic Aspects of a Module Concept for Graph Transformation Systems Process Specification and Verification Programmed Graph Transformations and Graph Transformation Units in GRACE

R Reconfiguration Graph Grammar for Massively Parallel, Fault Tolerant Computers S Software Integration Problems and Coupling of Graph Grammar Specifications Subapical Bracketed L-Systems Synchronized Composition of Graph Grammar Productions T The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars The Category of Typed Graph Grammars and its Adjunctions with Categories of Derivations The Contractum in Algebraic Graph Rewriting The Decomposition of ESM Computations The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed The Use of Tree Transducers to Compute Translations Between Graph Algebras Transformations of Graph Grammars U Using Attributed Flow Graph Parsing to Recognize Cliches in Programs