Produktbild: Graph Grammars and Their Application to Computer Science
Band 1073

Graph Grammars and Their Application to Computer Science 5th International Workshop, Williamsburg, VA, USA, November 13-18, 1994. Proceedings

97,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Lieferung nach Hause

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

08.05.1996

Herausgeber

Janice Cuny + weitere

Verlag

Springer Berlin

Seitenzahl

573

Maße (L/B/H)

23,5/15,5/3,1 cm

Gewicht

873 g

Auflage

1996

Sprache

Englisch

ISBN

978-3-540-61228-5

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

08.05.1996

Herausgeber

Verlag

Springer Berlin

Seitenzahl

573

Maße (L/B/H)

23,5/15,5/3,1 cm

Gewicht

873 g

Auflage

1996

Sprache

Englisch

ISBN

978-3-540-61228-5

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Graph Grammars and Their Application to Computer Science
  • A partial algebras approach to graph transformation.- The contractum in algebraic graph rewriting.- A category-theoretical approach to vertex replacement: The generation of infinite graphs.- Issues in the practical use of graph rewriting.- The category of typed graph grammars and its adjunctions with categories of derivations.- Graph unification and matching.- On the interleaving semantics of transformation units — A step into GRACE.- A graph rewriting framework for Statecharts semantics.- Programmed graph transformations and graph transformation units in GRACE.- Pragmatic and semantic aspects of a module concept for graph transformation systems.- Software integration problems and coupling of graph grammar specifications.- Using attributed flow graph parsing to recognize clichés in programs.- Reconfiguration Graph Grammar for massively parallel, fault tolerant computers.- The use of tree transducers to compute translations between graph algebras.- The bounded degree problem for non-obstructing eNCE graph grammars.- Process specification and verification.- An event structure semantics for graph grammars with parallel productions.- Synchronized composition of graph grammar productions.- The decomposition of ESM computations.- Formal relationship between graph grammars and Petri nets.- Hierarchically distributed graph transformation.- On edge addition rewrite systems and their relevance to program analysis.- Graph automata for linear graph languages.- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed.- Concatenation of graphs.- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting.- Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence.- Chain-code pictures and collages generated by hyperedge replacement.- Transformations of graph grammars.- Drawing graphs with attribute graph grammars.- Graph pattern matching in PROGRES.- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths.- The definition in monadic second-order logic of modular decompositions of ordered graphs.- Group based graph transformations and hierarchical representations of graphs.- Integrating lineage and interaction for the visualization of cellular structures.- Cellworks with cell rewriting and cell packing for plant morphogenesis.- Subapical bracketed L-systems.