Graph-Grammars and Their Application to Computer Science and Biology

International Workshop, Bad Honnef, October 30 - November 3, 1978

AvV. Claus,H. Ehrig

Häftad, Engelska, 1979

Del i serien Lecture Notes in Computer Science

560 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1979-07-01
Mått:155 x 233 x 27 mm
Vikt:739 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:486
Upplaga:1979
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540095255

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

to the algebraic theory of graph grammars (a survey).- A tutorial and bibliographical survey on graph grammars.- Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls.- Rewriting systems as a tool for relational data base design.- Programmed graph grammars.- Shortest path problems and tree grammars: An algebraic framework.- Constructing specifications of abstract data types by replacements.- Decomposition of graph grammar productions and derivations.- Locally star gluing formulas for a class of parallel graph grammars.- Transformations of data base structures.- Explicit versus implicit parallel rewriting on graphs.- Two-level graph grammars.- A pumping lemma for context-free graph languages.- Two-dimensional, differential, intercalary plant tissue growth and parallel graph generating and graph recurrence systems.- Parallel generation of maps: Developmental systems for cell layers.- Processes in structures.- Map grammars: Cycles and the algebraic approach.- On multilevel — Graph grammars.- Graph grammars and operational semantics.- Complexity of pattern generation by map-L systems.- A graph grammar that describes the set of two-dimensional surface networks.- Definition of programming language semantics using grammars for hierarchical graphs.- Determinism in relational systems.- Analysis of programs by reduction of their structure.- Graphs of processors.- Definitional mechanisms for conceptual graphs.- A graph-like lambda calculus for which leftmost-outermost reduction is optimal.- Relationships between graph grammars and the design and analysis of concurrent software.- Cellular graph automata.- List of participants.